{"id":"W1514479068","doi":"10.1109/ccece.2004.1349667","title":"Iterative decoding algorithm of lattices","year":2004,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Berlekamp–Welch algorithm; List decoding; Sequential decoding; Sequence (biology); Computational complexity theory; Computer science; Mathematics; Serial concatenated convolutional codes; Theoretical computer science; Discrete mathematics; Concatenated error correction code; Error floor; Block code","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.0009191665,0.0005783354,0.0008335487,0.0008037672,0.0008106383,0.001282429,0.001014336,0.001000818,0.003468775],"category_scores_gemma":[0.005247484,0.0003767126,0.0007989697,0.0009789934,0.0009294518,0.001131648,0.001925092,0.001560703,0.002317695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009003412,"about_ca_system_score_gemma":0.00184401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001335141,"about_ca_topic_score_gemma":0.001303491,"domain_scores_codex":[0.9986238,0.0004168995,0.00008708696,0.0001802937,0.0005282169,0.0001636546],"domain_scores_gemma":[0.9980178,0.0007582839,0.00009457947,0.0003752911,0.0006709501,0.000083],"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.0002623005,0.00005477754,0.0007495343,0.0002095561,0.00006916531,0.0003202156,0.0006135756,0.2147929,0.02396622,0.4689592,0.008751065,0.2812514],"study_design_scores_gemma":[0.00005300385,0.00006267719,0.0001516421,0.00004352982,0.00001581605,0.00031501,0.00004298011,0.7932047,0.02230045,0.1698405,0.01392918,0.00004048133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009426988,0.0001908207,0.9812909,0.0001789568,0.00006653862,0.00006475757,0.0001463668,0.0005497672,0.008084904],"genre_scores_gemma":[0.1879747,0.0004681186,0.7977999,0.0002449436,0.00009195483,0.0003250192,0.0005904589,0.0003725366,0.01213239],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003468775,"threshold_uncertainty_score":0.01160425,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01949282010571371,"score_gpt":0.2854545085488495,"score_spread":0.2659616884431358,"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."}}