{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007216274,0.0003998566,0.0005146823,0.0002440573,0.0003356031,0.0005209729,0.0004965575,0.0005117311,0.000962406],"category_scores_gemma":[0.002813664,0.0003786821,0.0002532387,0.0002802281,0.0005033905,0.001113677,0.0005709463,0.0006497146,0.0002696395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006093172,"about_ca_system_score_gemma":0.001276326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003251566,"about_ca_topic_score_gemma":0.004448263,"domain_scores_codex":[0.999608,0.0001521373,0.00001767461,0.000041726,0.0001006199,0.00007995939],"domain_scores_gemma":[0.9989473,0.0007382353,0.00009771447,0.00008842015,0.0000881778,0.00004012156],"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.0006931979,0.0001119186,0.0007809964,0.0001070778,0.00005504188,0.0001726811,0.0001196802,0.8332075,0.02411206,0.06356315,0.001021252,0.0760555],"study_design_scores_gemma":[0.0000151898,0.00003324998,0.00008720736,0.000007039415,0.000007536131,0.00002533342,0.000007004765,0.9877801,0.00383592,0.007991333,0.0001943536,0.00001564194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07876492,0.0003683969,0.9187406,0.0002554519,0.00002811647,0.00003424359,0.00008741903,0.0002859196,0.00143494],"genre_scores_gemma":[0.9318888,0.0004889532,0.06613684,0.00007153724,0.00002845723,0.00007204085,0.00011321,0.00003791933,0.001162368],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003251566,"threshold_uncertainty_score":0.006465256,"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."}}