{"id":"W2150494733","doi":"10.1109/lcomm.2004.825728","title":"On Construction of Rate-Compatible Low-Density Parity-Check Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":155,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Low-density parity-check code; Mathematics; Algorithm; Decoding methods","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.0004408894,0.0001421797,0.0002077942,0.0001987681,0.0002664419,0.00006206088,0.002173986,0.00006241162,0.000002128175],"category_scores_gemma":[0.0001047741,0.0001550988,0.00008065102,0.0005067338,0.0003352665,0.000300455,0.0002913405,0.0003514077,0.00003511686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001451008,"about_ca_system_score_gemma":0.00006843944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004156678,"about_ca_topic_score_gemma":0.0001431631,"domain_scores_codex":[0.9987984,0.0002425098,0.0003287923,0.0002551288,0.0001894871,0.0001856685],"domain_scores_gemma":[0.9961852,0.0003777365,0.0002404628,0.003006325,0.0001402782,0.00004992462],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003452712,0.0009255164,0.005352415,0.00008036241,0.000100959,0.000008953057,0.003735368,0.00534877,0.4622182,0.5069918,0.006000445,0.009202725],"study_design_scores_gemma":[0.001001931,0.0002171091,0.00917176,0.0004919808,0.00003198911,0.00006224983,0.0001234287,0.008992659,0.9170201,0.06164758,0.0005383539,0.0007008643],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5683506,0.00002168058,0.4209811,0.008937588,0.00027355,0.0001806589,0.000002623963,0.0004627035,0.0007894853],"genre_scores_gemma":[0.775834,0.00002826197,0.2228776,0.001213153,0.00001051606,0.00001904729,0.000004410802,0.000008626393,0.000004431776],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4548019,"threshold_uncertainty_score":0.6324746,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02667592626354847,"score_gpt":0.2780708074728517,"score_spread":0.2513948812093032,"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."}}