{"id":"W2510608886","doi":"10.1109/iscas.2016.7538902","title":"Matrix reordering for efficient list sphere decoding of polar codes","year":2016,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Polar code; Decoding methods; Computer science; List decoding; Algorithm; Generator matrix; Polar; Matrix (chemical analysis); Error detection and correction; Frame (networking); Sequential decoding; Code (set theory); Computational complexity theory; Parity-check matrix; Concatenated error correction code; Low-density parity-check code; Block code; Telecommunications","routes":{"ca_aff":true,"ca_fund":false,"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.0004234801,0.00009929732,0.0001494868,0.00007093904,0.00007066756,0.00003855902,0.0006423304,0.00004373024,0.00002170989],"category_scores_gemma":[0.0002212224,0.00006832822,0.00007582987,0.0001764153,0.00003004845,0.0001372551,0.0002310446,0.00003581183,0.000006275099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004947168,"about_ca_system_score_gemma":0.00003655377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000789916,"about_ca_topic_score_gemma":0.00006648727,"domain_scores_codex":[0.9991015,0.00002229971,0.0002306788,0.000270458,0.0001450308,0.0002300313],"domain_scores_gemma":[0.9989255,0.0003529966,0.0001080259,0.0004521107,0.0001174015,0.00004394425],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003050817,0.0001425038,0.009551307,0.0001742649,0.00003308705,0.000005098231,0.0008081927,0.0001443955,0.4567431,0.3198175,0.00406988,0.2084802],"study_design_scores_gemma":[0.0005111253,0.0002581407,0.0003586181,0.0003348122,0.000008012462,0.00002035598,0.00008072589,0.09163218,0.895219,0.006276687,0.00489234,0.0004080474],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07759933,0.0000639644,0.9187832,0.0003905111,0.000199953,0.0001841889,0.000002555047,0.0005722846,0.002203998],"genre_scores_gemma":[0.6266552,0.000003354048,0.3727709,0.00002112609,0.00001692202,0.000009621545,1.027658e-7,0.000007807233,0.0005149891],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5490559,"threshold_uncertainty_score":0.2786344,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01784664409250646,"score_gpt":0.2928884632980254,"score_spread":0.2750418192055189,"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."}}