{"id":"W1597749830","doi":"10.1109/dcc.2002.1000008","title":"Turbo source coding: a noise-robust approach to data compression","year":2003,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Huffman coding; Shannon–Fano coding; Tunstall coding; Variable-length code; Computer science; Algorithm; Additive white Gaussian noise; Arithmetic coding; Context-adaptive binary arithmetic coding; Turbo code; Data compression; Decoding methods; Concatenated error correction code; Entropy encoding; Theoretical computer science; Speech recognition; White noise; Block code; Telecommunications","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.000419112,0.0001837434,0.0001901108,0.00009237544,0.0002357664,0.0003257842,0.002955665,0.00006704008,0.00005756348],"category_scores_gemma":[0.00007839694,0.0001370343,0.00002993986,0.0004231365,0.00002431076,0.001183087,0.002330499,0.0001565146,0.0001586803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001998892,"about_ca_system_score_gemma":0.00004961463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005265076,"about_ca_topic_score_gemma":0.000001388626,"domain_scores_codex":[0.9980147,0.00009830159,0.0002279122,0.0008907391,0.0004064327,0.0003619315],"domain_scores_gemma":[0.9968672,0.00006866775,0.00005918144,0.0026808,0.00005336119,0.0002708117],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000219828,0.001073936,0.0003962624,0.00006203014,0.00003825784,0.00001713064,0.001073055,0.008842852,0.003808858,0.1715057,0.6937177,0.1194424],"study_design_scores_gemma":[0.0003062598,0.00002948234,0.000197702,0.00002729955,0.000003872623,0.00003016711,0.00005357047,0.7412378,0.001119865,0.0002658564,0.2564527,0.0002754905],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002721143,0.00006936292,0.9457454,0.000201376,0.0002732743,0.0002097856,0.00001152348,0.0002610347,0.05295609],"genre_scores_gemma":[0.1168695,0.000008214169,0.8793724,0.0010289,0.00008477556,0.00001235384,0.00007788883,0.00001670283,0.00252922],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7323949,"threshold_uncertainty_score":0.5588095,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08087794821133999,"score_gpt":0.2688048114372291,"score_spread":0.1879268632258891,"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."}}