{"id":"W2064067957","doi":"10.1109/isit.2014.6874999","title":"Branching MERA codes: A natural extension of classical and quantum polar codes","year":2014,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies; Natural Sciences and Engineering Research Council of Canada; Institut de Ciències Fotòniques; Compute Canada","keywords":"Quantum convolutional code; Computer science; Decoding methods; List decoding; Berlekamp–Welch algorithm; Theoretical computer science; Algorithm; Linear code; Concatenated error correction code; Discrete mathematics; Mathematics; Block code","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.0003924449,0.0001424599,0.000257137,0.00008381934,0.0001455652,0.00009375176,0.0003728477,0.00005253837,0.000002246057],"category_scores_gemma":[0.00009384175,0.0001010917,0.00006078559,0.0001741856,0.00009319857,0.0001415686,0.0002888398,0.0002372734,0.000003132412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005645255,"about_ca_system_score_gemma":0.00001975829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007153202,"about_ca_topic_score_gemma":0.0000107011,"domain_scores_codex":[0.9988102,0.0001190097,0.0002187314,0.0003735787,0.0002377459,0.0002407123],"domain_scores_gemma":[0.9991045,0.0003100187,0.00008015575,0.0003562631,0.0000586248,0.00009044239],"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.00002717281,0.0001525973,0.001064419,0.0001077672,0.00004598215,0.0000145192,0.002212536,0.001242446,0.0537186,0.5042962,0.0009577998,0.43616],"study_design_scores_gemma":[0.0002555399,0.0001291858,0.006129495,0.00005944957,0.000003854003,0.0000504391,0.00001290033,0.9826106,0.001570132,0.008057253,0.000973271,0.0001478079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5130933,0.0002265979,0.4848911,0.00122686,0.0002346943,0.00004782449,8.569564e-7,0.0001185109,0.0001602714],"genre_scores_gemma":[0.917363,0.000006488137,0.0821076,0.0003956522,0.00007854951,5.643286e-7,9.449902e-7,0.000006742738,0.00004048947],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9813682,"threshold_uncertainty_score":0.4122401,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007101051191386065,"score_gpt":0.2292656965864647,"score_spread":0.2221646453950786,"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."}}