{"id":"W2006624419","doi":"10.1109/18.923736","title":"Renyi's divergence and entropy rates for finite alphabet Markov sources","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Rényi entropy; Combinatorics; Markov chain; Alphabet; Discrete mathematics; Entropy (arrow of time); Coding theory; Divergence (linguistics); Entropy rate; Statistics; Binary entropy function; Physics; Principle of maximum entropy; Quantum mechanics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002531956,0.0001251109,0.0001075114,0.0001960977,0.000190504,0.00006860011,0.0001620705,0.00007888984,0.0001397189],"category_scores_gemma":[0.00001235251,0.0001304327,0.00005080931,0.000144244,0.00005969795,0.0009002766,0.00000165287,0.0001428326,0.00004018115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003483113,"about_ca_system_score_gemma":0.000007451739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000039998,"about_ca_topic_score_gemma":0.000003886741,"domain_scores_codex":[0.9993854,0.0000375515,0.0002714388,0.00006254679,0.00009867726,0.0001443629],"domain_scores_gemma":[0.9992448,0.000339768,0.00004927226,0.0002498618,0.00006583185,0.00005043807],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007496865,0.0001884409,0.0002439994,0.0005577728,0.000376406,0.000001049365,0.02099822,0.1428192,0.003388386,0.04441352,0.005091744,0.7811716],"study_design_scores_gemma":[0.002384634,0.0003443216,0.0007225922,0.0002454659,0.0001308457,0.00003518569,0.002699345,0.4590104,0.2757568,0.0369606,0.220373,0.001336773],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03114807,0.0001018057,0.966429,0.0001002586,0.0001651175,0.0002895083,0.00007208103,0.0006015346,0.001092611],"genre_scores_gemma":[0.9942922,0.00150331,0.003665615,0.0001684289,0.00001355656,0.0002014335,0.00002091616,0.00001428068,0.0001202409],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9631441,"threshold_uncertainty_score":0.5318893,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009192276345957163,"score_gpt":0.2380018457705932,"score_spread":0.228809569424636,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}