{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002682564,0.0005668714,0.0003023029,0.0006273253,0.0003990202,0.0006765656,0.0003961186,0.0003487084,0.003030899],"category_scores_gemma":[0.00157836,0.0001723219,0.0001970822,0.000815338,0.0003741675,0.000574075,0.0005900341,0.0005083827,0.001829298],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004019875,"about_ca_system_score_gemma":0.001161959,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001527568,"about_ca_topic_score_gemma":0.002868038,"domain_scores_codex":[0.999532,0.0001186354,0.00003263159,0.00003925767,0.0002310256,0.00004645294],"domain_scores_gemma":[0.9990878,0.0002960766,0.00009707658,0.0001582037,0.0003219729,0.00003894667],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007686554,0.0001076026,0.000813505,0.0002899441,0.00002835004,0.0005393523,0.0003674168,0.08803093,0.3640285,0.05015239,0.006440075,0.4884332],"study_design_scores_gemma":[0.0000612313,0.0003161577,0.0003962156,0.00003765055,0.00001433413,0.000743571,0.00008854604,0.6136085,0.3548915,0.01150815,0.01828345,0.00005063238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03790078,0.0003488233,0.9543815,0.000212361,0.0001081378,0.00009260508,0.0001450408,0.001451807,0.00535895],"genre_scores_gemma":[0.3449421,0.0005349962,0.646899,0.000213432,0.00008569135,0.0001048464,0.0004959721,0.0001751319,0.006548737],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003030899,"threshold_uncertainty_score":0.01013935,"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."}}