{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000487957,0.0000824931,0.00008094522,0.0001121052,0.0002259117,0.0001231523,0.00235409,0.00004642535,0.000001507847],"category_scores_gemma":[0.0005551021,0.00008690204,0.00003612052,0.000333809,0.00004934512,0.000407329,0.000673072,0.0002367965,0.0001338658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001266441,"about_ca_system_score_gemma":0.0000580769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002241599,"about_ca_topic_score_gemma":0.0001919735,"domain_scores_codex":[0.9991833,0.0001811597,0.0001548807,0.0001645968,0.0001715462,0.0001445427],"domain_scores_gemma":[0.9966113,0.0003204363,0.00007668383,0.002751062,0.0001545071,0.0000860117],"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.00001100207,0.0005096822,0.008699877,0.00000705066,0.00002262478,0.00000307088,0.008327764,0.0001639357,0.006333461,0.8953758,0.05205972,0.028486],"study_design_scores_gemma":[0.001100715,0.0005285616,0.006894402,0.0002413493,0.00002069531,0.00006175429,0.0006679057,0.7008606,0.009669105,0.1673915,0.1116258,0.0009376067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01230843,0.0002146573,0.9535285,0.005399821,0.0003686731,0.0002317313,0.000003404452,0.0017406,0.02620414],"genre_scores_gemma":[0.7872078,0.00002022456,0.2122722,0.0003324405,0.00001149227,0.00003057924,0.000006507522,0.000007460128,0.0001113346],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7748993,"threshold_uncertainty_score":0.4374523,"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."}}