{"id":"W1999589899","doi":"10.1109/icc.2004.1312525","title":"On construction of rate-compatible low-density parity-check codes","year":2004,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":158,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Turbo code; Puncturing; Block code; Raptor code; Computer science; Serial concatenated convolutional codes; Linear code; Hybrid automatic repeat request; Code rate; Algorithm; Concatenated error correction code; Code (set theory); Mathematics; Theoretical computer science; Decoding methods; Telecommunications; Programming language; Transmission (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.001772004,0.0003732138,0.0004266339,0.0007122752,0.0005974068,0.0006329764,0.0007200149,0.0005065664,0.0007751782],"category_scores_gemma":[0.004136202,0.0003613359,0.0005997238,0.0005067431,0.001181694,0.0008663569,0.001153434,0.0009623446,0.0003251816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004901208,"about_ca_system_score_gemma":0.0008244833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003478822,"about_ca_topic_score_gemma":0.0002625628,"domain_scores_codex":[0.9989016,0.0003871369,0.00005866216,0.0001234877,0.0004370176,0.00009199186],"domain_scores_gemma":[0.9983297,0.0008160528,0.0001857788,0.000422809,0.0001853778,0.00006022073],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000119955,0.00004621882,0.0008665933,0.0002044847,0.00002221769,0.0002887457,0.000269666,0.1152213,0.0268956,0.8030269,0.0006961979,0.05234215],"study_design_scores_gemma":[0.00007446452,0.0002723708,0.0005367252,0.0001038591,0.00003285646,0.0007523017,0.00006584633,0.6201935,0.06841347,0.2947469,0.01473205,0.00007567331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04049613,0.0002863129,0.9555781,0.000114592,0.00002438847,0.00007038776,0.000061162,0.000149233,0.003219779],"genre_scores_gemma":[0.4205505,0.0007901345,0.5758363,0.00010398,0.00005666914,0.0002398232,0.0002491917,0.0000955049,0.002077973],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001772004,"threshold_uncertainty_score":0.00937134,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01352686782819135,"score_gpt":0.2514271152527381,"score_spread":0.2379002474245467,"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."}}