{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005086894,0.0007957405,0.0008017283,0.001062949,0.0002803245,0.0009490874,0.001051682,0.0009027433,0.0064434],"category_scores_gemma":[0.002117001,0.0002170583,0.0004427692,0.001841365,0.0009457385,0.001140328,0.0005874772,0.001029817,0.003090945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004653916,"about_ca_system_score_gemma":0.000550412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008714225,"about_ca_topic_score_gemma":0.0008389549,"domain_scores_codex":[0.9995448,0.0001055935,0.00002832475,0.00004931212,0.0002447177,0.00002714807],"domain_scores_gemma":[0.9992004,0.0003228612,0.00004593619,0.00009994318,0.0003032749,0.00002754031],"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.0002299542,0.00005402156,0.0003130331,0.0007897318,0.0001265453,0.0005522215,0.0001255604,0.1557437,0.03271081,0.1633084,0.0403414,0.6057045],"study_design_scores_gemma":[0.00004141599,0.0002090334,0.0002337273,0.0001456637,0.00006460494,0.0006870671,0.00002504171,0.8240263,0.02510932,0.0929915,0.0563866,0.000079684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002770062,0.006408057,0.9785646,0.0006320081,0.0006037318,0.00007554364,0.0001170183,0.0008565398,0.009972503],"genre_scores_gemma":[0.2131429,0.03030042,0.714121,0.0006811672,0.003785675,0.0003471422,0.0009390985,0.000580117,0.03610235],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0064434,"threshold_uncertainty_score":0.02155536,"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."}}