{"id":"W2098209061","doi":"10.1109/lcomm.2006.1633327","title":"A class of irregular ldpc codes with low error floor and low encoding complexity","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"CMC Microsystems","keywords":"Low-density parity-check code; Encoder; Computer science; Encoding (memory); Algorithm; Error floor; Decoding methods; Parity-check matrix; Diagonal; Error detection and correction; Concatenated error correction code; Block code; Mathematics","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.0003563379,0.0001736706,0.0002462192,0.0001828673,0.0002919081,0.00009510179,0.002136867,0.00005184999,0.000001762151],"category_scores_gemma":[0.00002458381,0.0001676755,0.0000513805,0.0004736374,0.0006734746,0.0003522401,0.0004349156,0.0002594381,0.000004354937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006734405,"about_ca_system_score_gemma":0.00004404824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006448464,"about_ca_topic_score_gemma":0.0006506814,"domain_scores_codex":[0.998699,0.0002108946,0.0003228059,0.0002976588,0.0002303048,0.0002393089],"domain_scores_gemma":[0.9967875,0.0002424352,0.0002341026,0.002561272,0.0001259795,0.00004866379],"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.00004979245,0.001039546,0.02218915,0.0003530172,0.0001575371,0.00002863646,0.004626746,0.002046569,0.8604639,0.08270948,0.01467651,0.01165908],"study_design_scores_gemma":[0.002587402,0.0004936136,0.07464543,0.002007527,0.0001493756,0.0003749204,0.0004539276,0.5769106,0.3234008,0.01140799,0.005093956,0.002474512],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6170311,0.0001780954,0.3701197,0.01082835,0.0000850447,0.0003095772,0.000008261621,0.0005110219,0.0009289018],"genre_scores_gemma":[0.762536,0.00001249907,0.2368325,0.0005331998,0.00001535286,0.00003416259,0.000006260635,0.00001311271,0.00001683221],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.574864,"threshold_uncertainty_score":0.6837609,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03349696006564392,"score_gpt":0.2728399988835554,"score_spread":0.2393430388179114,"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."}}