{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000957469,0.000197142,0.0002051676,0.0002001196,0.0004936164,0.0001568584,0.003393098,0.00006394563,0.00000373964],"category_scores_gemma":[0.0002597914,0.0001994246,0.0001193577,0.0004193414,0.00009394091,0.0008625689,0.000540678,0.0003066392,0.00005374103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001119993,"about_ca_system_score_gemma":0.00003544338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005256686,"about_ca_topic_score_gemma":0.00002695413,"domain_scores_codex":[0.9985864,0.0002218032,0.0003144196,0.0002513202,0.0001489059,0.0004771301],"domain_scores_gemma":[0.9946942,0.001636655,0.0001747261,0.003278305,0.0001091214,0.0001069741],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00004918779,0.001639238,0.0321642,0.0002780843,0.0003863276,0.000003548289,0.02165174,0.001424566,0.5725167,0.1261128,0.1961437,0.04762992],"study_design_scores_gemma":[0.001623953,0.0002066984,0.006198317,0.0004223021,0.00009955284,0.00003970425,0.0003248159,0.3317205,0.3511171,0.004490968,0.3013052,0.002450856],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03716857,0.0003065944,0.9466765,0.01258661,0.0006740814,0.0005025565,0.000006323994,0.001115865,0.0009629191],"genre_scores_gemma":[0.5942802,0.00002537519,0.403135,0.002180254,0.00006948593,0.0002452302,0.000009013702,0.00001816428,0.00003731711],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5571116,"threshold_uncertainty_score":0.8132299,"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."}}