{"id":"W162020490","doi":"","title":"Algorithmic approaches to joint source-channel coding","year":2005,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Binary erasure channel; Computer science; Redundancy (engineering); Channel (broadcasting); Coding (social sciences); Erasure; Algorithm; Decoding methods; Scalability; Erasure code; Source code; Variable-length code; Shannon–Fano coding; Theoretical computer science; Network packet; Channel capacity; Computer network; Mathematics; Statistics","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.002140047,0.001153965,0.0007874033,0.00133868,0.0009683938,0.002185918,0.002412011,0.001671527,0.005466036],"category_scores_gemma":[0.006007586,0.0007281493,0.00102378,0.001544284,0.002440706,0.002411434,0.002694229,0.002559842,0.001006665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001861843,"about_ca_system_score_gemma":0.00226735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002401309,"about_ca_topic_score_gemma":0.00266382,"domain_scores_codex":[0.9982567,0.0007110102,0.00007872677,0.0002626622,0.0005356065,0.0001551788],"domain_scores_gemma":[0.9969195,0.002119704,0.0001449721,0.0003880353,0.0003741395,0.00005369131],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000021986,0.00003460916,0.0002173866,0.0001074413,0.00002934257,0.00004986981,0.00009138444,0.3200704,0.0006087665,0.6482205,0.001525864,0.02902249],"study_design_scores_gemma":[0.00002176744,0.0000247379,0.00005540105,0.00002833854,0.000008927702,0.00003675624,0.00002670614,0.580874,0.000391997,0.4136008,0.004913867,0.00001674201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001617536,0.0003492089,0.9910071,0.0002591237,0.00003183632,0.00004136714,0.00004672497,0.0000711493,0.006575802],"genre_scores_gemma":[0.1718007,0.001845847,0.816982,0.000329788,0.0002577684,0.0006315502,0.0003864532,0.000131275,0.007634564],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005466036,"threshold_uncertainty_score":0.01828575,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1276900345239621,"score_gpt":0.2368964247133945,"score_spread":0.1092063901894324,"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."}}