{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002270208,0.0001316657,0.00013613,0.0001088038,0.0001520215,0.0001974259,0.0006879449,0.000043327,0.00004473321],"category_scores_gemma":[0.00001340857,0.0001039918,0.00004897709,0.000224174,0.00001336028,0.0005575683,0.0007683416,0.00009733951,0.0005066596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003819199,"about_ca_system_score_gemma":0.0000211137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003692124,"about_ca_topic_score_gemma":0.000004135884,"domain_scores_codex":[0.998821,0.00002354527,0.0001878792,0.0004160892,0.0002443797,0.0003071166],"domain_scores_gemma":[0.9991723,0.00002510915,0.00003682189,0.0005559996,0.0000215226,0.0001883024],"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.000002874451,0.0001128116,0.000008574696,0.00000793528,0.00001201279,0.000005386241,0.001535322,0.005782295,0.0009808202,0.04028017,0.02366481,0.927607],"study_design_scores_gemma":[0.0001570193,0.00003842005,0.0001322575,0.00001560394,0.000001569657,0.00001888366,0.00005753725,0.9345314,0.007381581,0.0006566416,0.05680234,0.000206737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008370088,0.00004910201,0.9894789,0.003823111,0.0001675566,0.0001453212,0.000001830226,0.0002944352,0.005202708],"genre_scores_gemma":[0.2398498,0.00000629809,0.7551653,0.001425216,0.0004543361,0.00002442776,0.000004342259,0.00001298754,0.003057336],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9287491,"threshold_uncertainty_score":0.6512252,"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."}}