{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005987535,0.0005086153,0.0006569392,0.0003501297,0.0007155329,0.0002385658,0.005043254,0.0002655303,0.0001741737],"category_scores_gemma":[0.0003258232,0.0005444707,0.0002795418,0.0009606418,0.0004388596,0.001680007,0.001592585,0.0005487263,0.0002310123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005924323,"about_ca_system_score_gemma":0.000615831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000328433,"about_ca_topic_score_gemma":0.001041807,"domain_scores_codex":[0.9959073,0.0003824097,0.001398548,0.0008093231,0.0006246332,0.0008777892],"domain_scores_gemma":[0.9938712,0.0003320848,0.0007706599,0.003809868,0.0008315394,0.0003846997],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007072247,0.002970587,0.002170013,0.00008416251,0.0003496969,0.000009652871,0.0009938935,0.01696705,0.0240625,0.5309129,0.189261,0.2321478],"study_design_scores_gemma":[0.002161255,0.0002074746,0.003441898,0.000437938,0.00007406538,0.0002813365,0.000281727,0.7115517,0.02000188,0.04047668,0.2194397,0.001644306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003788705,0.0006321429,0.9802824,0.003741243,0.0003763725,0.0006476503,0.000418872,0.001075426,0.009037232],"genre_scores_gemma":[0.5866039,0.0005414588,0.4118232,0.0003993179,0.00005888722,0.0001294333,0.0001083918,0.00001757292,0.0003178552],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6945847,"threshold_uncertainty_score":0.9997007,"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."}}