{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009619805,0.0001512562,0.0001345481,0.0003002995,0.0003094068,0.0001272063,0.0004440196,0.0001081133,0.00002452293],"category_scores_gemma":[0.00003256016,0.0001423622,0.0001258037,0.0002786947,0.00004509562,0.003659806,0.000003019901,0.0002044279,0.0002149483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008472576,"about_ca_system_score_gemma":0.00003758336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004208441,"about_ca_topic_score_gemma":7.467821e-7,"domain_scores_codex":[0.9989319,0.00008674691,0.0003171764,0.0001098964,0.0002102688,0.0003439666],"domain_scores_gemma":[0.9988019,0.0004085378,0.0001303896,0.0004221515,0.000123888,0.0001130645],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001008244,0.0002383849,0.000006952313,0.00007241771,0.00005246254,1.614455e-7,0.008921013,0.001661938,0.0006203869,0.7509344,0.003240333,0.2341507],"study_design_scores_gemma":[0.001492417,0.0009007237,0.0001099444,0.0001695121,0.00008140411,0.00008925891,0.001166325,0.2827327,0.4793935,0.130557,0.1019105,0.001396744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001061636,0.00001486012,0.9932668,0.0003545583,0.002337741,0.0003845144,0.00002400826,0.0009962532,0.001559696],"genre_scores_gemma":[0.9737867,0.000007252514,0.02481359,0.00086407,0.00007133831,0.0002085212,0.000004170902,0.00001082885,0.0002336053],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.972725,"threshold_uncertainty_score":0.5805361,"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."}}