{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000332847,0.0001127725,0.0001840494,0.0001128466,0.00007597877,0.00004227819,0.0004192876,0.00006451094,0.00001329995],"category_scores_gemma":[0.0001025745,0.0001037402,0.00005432697,0.0003216682,0.00008288133,0.0002342258,0.0001221617,0.0001485645,0.00003666247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006963225,"about_ca_system_score_gemma":0.00007471494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005483303,"about_ca_topic_score_gemma":0.0001412578,"domain_scores_codex":[0.9990826,0.00005770327,0.0002177316,0.0002852819,0.0001919703,0.0001646754],"domain_scores_gemma":[0.9990765,0.0001135867,0.0001187762,0.0005106233,0.0001324138,0.00004809159],"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.00001932832,0.0002051415,0.004398139,0.00003412741,0.00001394994,0.00000855857,0.0004680034,0.0005064095,0.01825078,0.9698966,0.0006160637,0.005582939],"study_design_scores_gemma":[0.0002635291,0.0001941788,0.004394952,0.00007544597,0.000003307739,0.00002174189,0.00003325711,0.002834809,0.835952,0.1560467,0.0000211994,0.0001588589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.50701,0.000003266422,0.4864095,0.0002288974,0.0002227184,0.00008827761,4.133289e-7,0.0005237389,0.005513207],"genre_scores_gemma":[0.8003931,0.00000290667,0.199379,0.000160023,0.00001094378,0.000002945643,6.293688e-7,0.000004588095,0.00004586152],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8177013,"threshold_uncertainty_score":0.4230404,"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."}}