{"id":"W2164938435","doi":"10.1109/glocom.2005.1577874","title":"Joint source-channel decoding of convolutionally encoded multiple-descriptions","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Convolutional code; Computer science; Decoding methods; Viterbi decoder; Viterbi algorithm; Algorithm; Sequential decoding; Turbo code; Binary erasure channel; Soft output Viterbi algorithm; Channel (broadcasting); Serial concatenated convolutional codes; Theoretical computer science; Concatenated error correction code; Telecommunications; Channel capacity; Block 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.00198542,0.0006623499,0.0008209344,0.0004671361,0.0003777317,0.0009446137,0.0009432965,0.0009654509,0.001080941],"category_scores_gemma":[0.00562103,0.0004188136,0.0004078604,0.0007432448,0.0006993422,0.001473031,0.001314823,0.0009687213,0.0003493358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001100078,"about_ca_system_score_gemma":0.001825947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003503594,"about_ca_topic_score_gemma":0.003833456,"domain_scores_codex":[0.9987118,0.0004619427,0.00007224319,0.0001258172,0.0004434341,0.0001846611],"domain_scores_gemma":[0.9966856,0.002126773,0.0002730695,0.0004071942,0.0004327938,0.00007454264],"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.000412655,0.00006558024,0.0009550232,0.0001198326,0.00006176301,0.0003739127,0.0001590284,0.8520412,0.01084874,0.07024612,0.0009133324,0.0638028],"study_design_scores_gemma":[0.00001497486,0.00003156458,0.00005674948,0.000007990188,0.000006002689,0.00006049713,0.00001140239,0.9799468,0.01034828,0.009127393,0.000376861,0.00001153032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06063905,0.0003289434,0.9360143,0.000187297,0.00003662489,0.00006181745,0.0001423719,0.0004061558,0.002183417],"genre_scores_gemma":[0.842872,0.0002183293,0.1526468,0.00007212525,0.0000207052,0.00006102515,0.0002484962,0.00005462351,0.003805861],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003503594,"threshold_uncertainty_score":0.01050001,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05186381459234656,"score_gpt":0.291604937948759,"score_spread":0.2397411233564124,"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."}}