{"id":"W2061690338","doi":"10.1049/iet-com.2014.0535","title":"On polar multiple description coding","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Encoder; Computer science; Polar; Polar code; Algorithm; Coding (social sciences); Binary number; Hamming distance; Hamming code; Variable-length code; Decoding methods; Network packet; Multiple description coding; Theoretical computer science; Block code; Computer network; Arithmetic; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.001150853,0.0005007497,0.0004197663,0.001047487,0.0004006687,0.001060269,0.0008231857,0.000652852,0.002400777],"category_scores_gemma":[0.003362141,0.0002724763,0.0002967884,0.001511634,0.00111923,0.0019929,0.001716688,0.001362457,0.0008532928],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007231458,"about_ca_system_score_gemma":0.0008455761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001967868,"about_ca_topic_score_gemma":0.001128453,"domain_scores_codex":[0.9990256,0.0003533024,0.0000408467,0.0001038521,0.0003928389,0.00008353763],"domain_scores_gemma":[0.9985079,0.0007793696,0.00007797015,0.0002474531,0.0003579955,0.00002917995],"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.0001751739,0.00002366637,0.0003421362,0.0002504302,0.00001743917,0.0002679845,0.0001916719,0.06537056,0.00813044,0.7486679,0.005358719,0.171204],"study_design_scores_gemma":[0.00004722248,0.0001456278,0.0002932012,0.0002142936,0.00003141034,0.0006211107,0.00006993562,0.6263743,0.01565193,0.3083329,0.04813741,0.00008064201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005231763,0.00288878,0.9770348,0.000492307,0.0001631594,0.00006477041,0.0001111391,0.0001074175,0.01390582],"genre_scores_gemma":[0.4265184,0.0163606,0.5376031,0.001141721,0.00072726,0.0004193106,0.0009516328,0.0001260957,0.0161518],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002400777,"threshold_uncertainty_score":0.008031428,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1432675699820407,"score_gpt":0.3265984394758602,"score_spread":0.1833308694938195,"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."}}