{"id":"W2136333263","doi":"10.1109/isit.1998.708800","title":"Optimal use of Markov models for DPCM picture transmission over binary symmetric channels","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Binary number; Viterbi algorithm; Binary symmetric channel; Markov chain; Algorithm; Redundancy (engineering); Generalization; Markov process; Decoding methods; Markov model; Residual; Channel (broadcasting); Transmission (telecommunications); Theoretical computer science; Mathematics; Arithmetic; Telecommunications; Channel code","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.0001069192,0.0001858796,0.0002405159,0.0003415725,0.0000766857,0.00006375672,0.0009085986,0.0001179141,0.0001362227],"category_scores_gemma":[0.00003220392,0.0001431465,0.0001166542,0.0006391492,0.00003098633,0.001995798,0.0002942874,0.0001133362,0.000002599855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002211279,"about_ca_system_score_gemma":0.00001028927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006440427,"about_ca_topic_score_gemma":6.697328e-8,"domain_scores_codex":[0.9986212,0.00003678001,0.0003054928,0.000453959,0.0002989116,0.0002836124],"domain_scores_gemma":[0.9986466,0.0002368253,0.0001104421,0.0007871666,0.0001029768,0.0001160044],"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.0001191443,0.0008082024,0.00002125912,0.0002046185,0.00004573145,0.00002247554,0.0006126953,0.07730811,0.02091104,0.09261121,0.1573467,0.6499889],"study_design_scores_gemma":[0.0003082614,0.0001887142,0.00001738361,0.00004827988,0.000004732521,0.000005052529,0.000002500093,0.9438292,0.03283403,0.004558512,0.01801609,0.0001872188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001453647,0.0003120431,0.9965715,0.0002112285,0.0001037209,0.0004404532,0.00002648873,0.0003737458,0.0005071195],"genre_scores_gemma":[0.1287727,0.0001762617,0.8692293,0.0002650842,0.00002519875,0.00004243829,0.000007430353,0.00001703385,0.001464609],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8665211,"threshold_uncertainty_score":0.5837343,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04973822583676285,"score_gpt":0.2725702232461532,"score_spread":0.2228319974093903,"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."}}