{"id":"W2129729322","doi":"10.1109/bsc.2006.1644558","title":"Capacity-Approaching LDPC Codes with Low Error Floors for High-Speed Digital Communications","year":2006,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; CMC Microsystems","keywords":"Low-density parity-check code; Computer science; Encoder; Permutation matrix; Error detection and correction; Algorithm; Forward error correction; Turbo code; Circulant matrix; Degree (music); Decoding methods; Electronic engineering; Computer engineering; Engineering","routes":{"ca_aff":true,"ca_fund":true,"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.0004518182,0.0004318276,0.0002621391,0.0004287394,0.0004586577,0.0005547913,0.0003418029,0.0004624162,0.0008008743],"category_scores_gemma":[0.002591969,0.0002191466,0.0001591919,0.0006309713,0.0007619184,0.0006494144,0.0004140727,0.0006608643,0.0002968243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005166397,"about_ca_system_score_gemma":0.0006584059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003602454,"about_ca_topic_score_gemma":0.0007239301,"domain_scores_codex":[0.9996675,0.0001013309,0.00001827576,0.00003783137,0.0001378643,0.0000372403],"domain_scores_gemma":[0.9986191,0.0006846554,0.0002151447,0.0002264323,0.0001958738,0.00005891458],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003327678,0.0001147572,0.002490751,0.0007454859,0.00004235149,0.000512382,0.0004298663,0.3259559,0.3260617,0.1594296,0.001824573,0.1820599],"study_design_scores_gemma":[0.00007518116,0.0004127569,0.001015309,0.00008207763,0.00005399311,0.0008903246,0.00007659813,0.6776939,0.2356678,0.05996683,0.02398802,0.00007714193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1816123,0.001944133,0.8091537,0.0005300039,0.00006049643,0.00008687725,0.0001067732,0.0006430315,0.005862663],"genre_scores_gemma":[0.7541974,0.001274808,0.2418553,0.0001074727,0.00007181489,0.0001013305,0.0001736873,0.00008241868,0.002135758],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0008008743,"threshold_uncertainty_score":0.003748477,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02830437735660124,"score_gpt":0.255317386216757,"score_spread":0.2270130088601557,"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."}}