{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005293377,0.0006884775,0.0006489915,0.001230775,0.0004910624,0.0007100087,0.0007775964,0.0004391163,0.001733103],"category_scores_gemma":[0.00362225,0.000314536,0.0006305553,0.000771524,0.0005932118,0.0009822045,0.0006195619,0.0008865074,0.0006686185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009539888,"about_ca_system_score_gemma":0.001341629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001894159,"about_ca_topic_score_gemma":0.001883514,"domain_scores_codex":[0.9993277,0.0001746655,0.00002482626,0.00005287836,0.0003731211,0.00004692463],"domain_scores_gemma":[0.9985182,0.0008110612,0.0001051498,0.000213293,0.0003239205,0.00002844156],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004494091,0.00003030077,0.000798738,0.0001883739,0.00004635612,0.0002903412,0.000117802,0.7519264,0.02160876,0.1481347,0.001329731,0.07548355],"study_design_scores_gemma":[0.000003215782,0.000008141435,0.0001362769,0.00001094806,0.000005019645,0.00004423398,0.000004887207,0.9686603,0.00355587,0.02643463,0.001127791,0.000008677098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01052607,0.0002137543,0.9870782,0.00004671742,0.00001330799,0.00003666738,0.0001067962,0.0002414464,0.001737052],"genre_scores_gemma":[0.423685,0.001128389,0.5678817,0.00007851391,0.00007914282,0.0003849507,0.0007474768,0.0002979451,0.005716824],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001894159,"threshold_uncertainty_score":0.006921709,"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."}}