{"id":"W2094676669","doi":"10.1109/tit.2012.2218792","title":"Polar Codes for Classical-Quantum Channels","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"ExxonMobil Research and Engineering Company; Defense Advanced Research Projects Agency; École Polytechnique Fédérale de Lausanne; Ministère du Développement Économique, de l’Innovation et de l’Exportation","keywords":"Classical capacity; Computer science; Quantum capacity; Quantum channel; Polar code; Channel capacity; Channel (broadcasting); Quantum; Puncturing; Decoding methods; Algorithm; Mathematics; Topology (electrical circuits); Theoretical computer science; Quantum information; Telecommunications; Physics; Quantum mechanics; Quantum network; Combinatorics","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.000757947,0.0004123444,0.0002853824,0.0005867117,0.0006226974,0.001342141,0.0004590155,0.0007007118,0.003418772],"category_scores_gemma":[0.003303268,0.0002449462,0.000386385,0.0005607356,0.001999088,0.001944438,0.001889827,0.001747594,0.000739177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008778012,"about_ca_system_score_gemma":0.0008474967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005498842,"about_ca_topic_score_gemma":0.0003806136,"domain_scores_codex":[0.9991721,0.0002230635,0.00002998459,0.0001037661,0.0003433188,0.0001278245],"domain_scores_gemma":[0.9977577,0.001235758,0.0001990635,0.0003681885,0.0003293713,0.0001098337],"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.00002668622,0.000007739936,0.00006391631,0.00002132993,0.000001938356,0.00002126445,0.00007489448,0.007136919,0.001150151,0.9849532,0.0005261601,0.006015795],"study_design_scores_gemma":[0.00001651077,0.00001810903,0.0001108766,0.00002126935,0.000004824386,0.00005103712,0.00003800994,0.05374081,0.003610726,0.9372977,0.005074889,0.00001526042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1007285,0.0008992315,0.8216268,0.001530174,0.0001915571,0.0001235768,0.0004068284,0.000240789,0.07425248],"genre_scores_gemma":[0.8537337,0.001354951,0.1278256,0.0007740698,0.0002895768,0.0003573647,0.0005211472,0.00009340042,0.01505032],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003418772,"threshold_uncertainty_score":0.01143694,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01878489496873109,"score_gpt":0.2653956083520281,"score_spread":0.246610713383297,"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."}}