{"id":"W2554630205","doi":"10.1109/allerton.2012.6483473","title":"Real-time coding of Gauss-Markov sources over burst erasure channels","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Erasure; Binary erasure channel; Algorithm; Encoder; Markov process; Computer science; Markov chain; Network packet; Gaussian; Markov model; Upper and lower bounds; Channel (broadcasting); Mathematics; Channel capacity; Telecommunications; Physics; Statistics; Computer network","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001743175,0.0005189246,0.0005031008,0.0004020764,0.000244667,0.0005594229,0.000577816,0.0004921315,0.0006297826],"category_scores_gemma":[0.005677026,0.0002136833,0.0002471831,0.0005420147,0.001168968,0.001392173,0.0008913985,0.0007391315,0.00009098268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007092353,"about_ca_system_score_gemma":0.0005503839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001958399,"about_ca_topic_score_gemma":0.001167663,"domain_scores_codex":[0.9994287,0.0002369091,0.00001812189,0.00003808119,0.0001640324,0.0001141762],"domain_scores_gemma":[0.994535,0.004331587,0.0005224773,0.0002264154,0.000303589,0.00008091357],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001587366,0.00002251033,0.0003927307,0.00004676653,0.00001537307,0.000105181,0.00009881289,0.9221696,0.004858171,0.06378815,0.0001607858,0.00818312],"study_design_scores_gemma":[0.000005517689,0.00001802899,0.00004822968,0.000003248586,0.000001912371,0.0000175608,0.000009051533,0.9923516,0.001233919,0.006234377,0.00007193181,0.000004527578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2611979,0.0009468413,0.734766,0.0003896788,0.00003060723,0.00002897235,0.00005715534,0.0001516383,0.002431132],"genre_scores_gemma":[0.9795889,0.0003741628,0.01915933,0.00002753902,0.00001486407,0.00002000965,0.00002826208,0.00001254749,0.0007743913],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001958399,"threshold_uncertainty_score":0.009218931,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01435351499204926,"score_gpt":0.2466268061021957,"score_spread":0.2322732911101464,"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."}}