{"id":"W2126979605","doi":"10.1109/tit.2010.2059651","title":"New Coding Schemes for the Symmetric $K$-Description Problem","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Erasure; Gaussian; Linear network coding; Computer science; Algorithm; Rate–distortion theory; Decoding methods; Theoretical computer science; Coding (social sciences); Multiple description coding; Quantization (signal processing); Binary erasure channel; Quadratic equation; Mathematical optimization; Mathematics; Channel (broadcasting); Channel capacity; Data compression; Telecommunications; Statistics; Network packet","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.0007994651,0.000111901,0.00008161409,0.0002542521,0.000761254,0.0003736364,0.0007091177,0.00006267034,0.00008015354],"category_scores_gemma":[0.00003223013,0.00008420928,0.00008845892,0.000645995,0.00003667359,0.00209179,0.000005398164,0.0003404564,0.0001337175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003451822,"about_ca_system_score_gemma":0.00008751891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002398357,"about_ca_topic_score_gemma":0.00001266672,"domain_scores_codex":[0.9992301,0.00005682363,0.0002822442,0.0001026579,0.0001669358,0.0001612586],"domain_scores_gemma":[0.9985155,0.0005796385,0.0001131788,0.0005469659,0.0001798635,0.00006481221],"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.00001137002,0.00001063084,3.641036e-7,0.000004622941,0.00001190679,1.015229e-8,0.0006670079,0.0005925085,0.0004280479,0.459824,0.0006196969,0.5378298],"study_design_scores_gemma":[0.001754542,0.0001915046,0.0001326491,0.00006448983,0.00005064004,0.0000226001,0.000406807,0.5071239,0.03299259,0.03655694,0.4201493,0.0005539968],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001257184,0.0000373239,0.9941592,0.001386751,0.00107679,0.0004657207,0.000003785205,0.0002092397,0.002535448],"genre_scores_gemma":[0.9430603,0.0001985293,0.05456669,0.001028933,0.00006249244,0.0001674947,0.000004303767,0.000007195978,0.0009040928],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9429346,"threshold_uncertainty_score":0.5855027,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0253556863921865,"score_gpt":0.2554970244999948,"score_spread":0.2301413381078083,"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."}}