{"id":"W2119420182","doi":"10.1109/icc.2007.116","title":"An Efficient Analysis of Finite-Length LDPC Codes","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Code word; Decoding methods; Algorithm; Concatenated error correction code; Channel (broadcasting); Computer science; Mathematics; Block (permutation group theory); Parity-check matrix; Block code; Telecommunications; Combinatorics","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.00121624,0.00009985028,0.0002195265,0.0006483888,0.00004987208,0.000038995,0.0008895902,0.00005205681,0.00003035938],"category_scores_gemma":[0.0001013802,0.00008669498,0.0001197561,0.002236577,0.00003102067,0.0001198327,0.0001288081,0.00008346538,0.000006509634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003169578,"about_ca_system_score_gemma":0.00002315183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002062681,"about_ca_topic_score_gemma":0.0003447472,"domain_scores_codex":[0.9988152,0.00004595167,0.0002910406,0.0003170965,0.0002978791,0.0002327788],"domain_scores_gemma":[0.9983968,0.0003982651,0.0001129777,0.0008617125,0.0001470135,0.00008319282],"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.0000580055,0.002468272,0.1337813,0.00005088162,0.001264885,0.00008493485,0.01318569,0.1365812,0.04287851,0.4295295,0.0009094079,0.2392075],"study_design_scores_gemma":[0.00005465888,0.0001375248,0.01934696,0.000006010675,0.00007577481,9.143116e-7,0.00009725578,0.9049756,0.07477395,0.0002483075,0.00012774,0.0001553333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2708177,0.00001074124,0.7231224,0.0000282316,0.00008454887,0.00004936915,8.58597e-7,0.0004952414,0.005390971],"genre_scores_gemma":[0.8034339,0.000001217277,0.1963879,0.0001002222,0.000009715967,0.000001331992,0.000001580034,0.000004149823,0.00006001183],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7683944,"threshold_uncertainty_score":0.3535319,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01563949730224952,"score_gpt":0.3026015579986918,"score_spread":0.2869620606964423,"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."}}