{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002836125,0.0001894427,0.0001998833,0.0001269046,0.0003483623,0.0004425834,0.001798321,0.00006545813,0.000002058435],"category_scores_gemma":[0.00005854341,0.000155166,0.00006271523,0.0003510233,0.0001387754,0.0009357443,0.0003689567,0.0001965285,0.00001026753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007103782,"about_ca_system_score_gemma":0.00005170747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007925193,"about_ca_topic_score_gemma":0.0007481102,"domain_scores_codex":[0.998782,0.00004467018,0.0002558783,0.0003801943,0.0002168774,0.0003203531],"domain_scores_gemma":[0.997858,0.0003102052,0.0001235942,0.001494461,0.0001569973,0.00005668008],"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.00002846307,0.0007603816,0.007368238,0.00006501032,0.00006265058,0.000004403994,0.001407539,0.0009104545,0.00303544,0.9554564,0.006341828,0.02455914],"study_design_scores_gemma":[0.001884056,0.0008932458,0.006078719,0.0002695536,0.00005452545,0.0001563616,0.0004267644,0.8213717,0.05914081,0.1007373,0.006959511,0.002027434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07753023,0.00001814181,0.9060451,0.001420474,0.00007849983,0.0004630901,0.00001285925,0.001689571,0.01274206],"genre_scores_gemma":[0.586679,5.590045e-7,0.4126872,0.00008008387,0.00002434334,0.00003849116,0.00001698521,0.00001453936,0.0004587465],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8547192,"threshold_uncertainty_score":0.6327485,"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."}}