{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001585322,0.00006345933,0.00009035105,0.00007814016,0.00003748139,0.00004160184,0.0004475436,0.00002590745,0.000007985534],"category_scores_gemma":[0.00003246459,0.00005440606,0.0000323387,0.0002420574,0.0000212745,0.0003914306,0.0001431872,0.00006002191,0.0000113635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002844937,"about_ca_system_score_gemma":0.0000331807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008554132,"about_ca_topic_score_gemma":0.00001924782,"domain_scores_codex":[0.9994443,0.00001631774,0.0001347436,0.0001662817,0.0001251719,0.000113154],"domain_scores_gemma":[0.9995173,0.00006287739,0.00006523731,0.0002534879,0.000073762,0.00002736299],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000001717047,0.0001368655,0.001026566,0.00002061552,0.00002629035,0.00002466528,0.007662443,0.0001643202,0.009171098,0.4321737,0.0002900699,0.5493017],"study_design_scores_gemma":[0.0003076076,0.0002422446,0.0007359565,0.0001078624,0.000004688222,0.00003422817,0.0001261019,0.05563726,0.8633674,0.0788091,0.0003555005,0.0002720827],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01138011,0.00002942608,0.9764124,0.0002663131,0.0001267053,0.00005756274,2.77119e-7,0.0004229099,0.01130431],"genre_scores_gemma":[0.4107426,0.000002067967,0.5890881,0.00007945452,0.000009465422,0.000002334888,9.967184e-8,0.000002278142,0.00007360326],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8541963,"threshold_uncertainty_score":0.2218615,"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."}}