{"id":"W2030719027","doi":"10.1109/lcomm.2012.112812.121785","title":"A Rate-Compatible Puncturing Scheme for Finite-Length LDPC Codes","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Puncturing; Low-density parity-check code; Additive white Gaussian noise; Algorithm; Computer science; Forward error correction; Turbo code; Bit error rate; Concatenated error correction code; Mathematics; Code (set theory); Decoding methods; Channel (broadcasting); Theoretical computer science; Block code; Telecommunications","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.001011563,0.0005735587,0.0004875807,0.0005375486,0.000650446,0.000433392,0.0009919708,0.0006213745,0.0007768351],"category_scores_gemma":[0.003728975,0.0002454919,0.000474907,0.0005127784,0.0007276748,0.0009803935,0.0009744025,0.0007399328,0.0004159045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004006229,"about_ca_system_score_gemma":0.0006111367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002343028,"about_ca_topic_score_gemma":0.0002406153,"domain_scores_codex":[0.9990074,0.000322942,0.00008871662,0.0001130388,0.0004011604,0.00006669652],"domain_scores_gemma":[0.9977209,0.0005951847,0.0004627148,0.0007665999,0.0003533626,0.0001012385],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001296068,0.0001416003,0.003169541,0.0005440305,0.0001385205,0.001282043,0.0008987295,0.1595076,0.3108434,0.112782,0.001872158,0.4075244],"study_design_scores_gemma":[0.0001719264,0.001082654,0.001479915,0.0001137123,0.0001158051,0.00284355,0.00008251605,0.7056189,0.2461427,0.02578695,0.01635583,0.000205486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06055177,0.000535251,0.9365857,0.0001455641,0.00007738736,0.00009532817,0.00006721108,0.0005090653,0.001432759],"genre_scores_gemma":[0.6151999,0.0003789668,0.3822142,0.0001013642,0.00008936672,0.0001156447,0.0001029511,0.00005450097,0.001743151],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001011563,"threshold_uncertainty_score":0.005349755,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06853258175673221,"score_gpt":0.3152987726318352,"score_spread":0.246766190875103,"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."}}