{"id":"W2095820036","doi":"10.1109/ccece.2004.1345016","title":"Irregular rate-compatible LDPC codes for capacity-approaching hybrid-ARQ schemes","year":2004,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Turbo code; Puncturing; Hybrid automatic repeat request; Block code; Serial concatenated convolutional codes; Concatenated error correction code; Raptor code; Algorithm; Linear code; Computer science; Code rate; Mathematics; Forward error correction; Decoding methods; Telecommunications; 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.0008917098,0.0003859736,0.0003028998,0.0004249346,0.0003908926,0.0004305569,0.0005700244,0.0003736024,0.0007258356],"category_scores_gemma":[0.002388854,0.0001823957,0.0002481929,0.0004278201,0.0007649143,0.0005660313,0.0006307957,0.000703383,0.0002891567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004361678,"about_ca_system_score_gemma":0.0005462038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003059235,"about_ca_topic_score_gemma":0.0003905811,"domain_scores_codex":[0.9994428,0.000176484,0.00003193027,0.00005660157,0.0002482757,0.00004389212],"domain_scores_gemma":[0.9982308,0.0006550431,0.0002434631,0.0005379601,0.0002674429,0.00006543285],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004536285,0.00009141661,0.002378118,0.0003991855,0.00005028362,0.0007582611,0.0006180363,0.2823432,0.1506266,0.4131996,0.001502714,0.147579],"study_design_scores_gemma":[0.00005263879,0.0002538963,0.000719209,0.00005736895,0.00002920834,0.0007308914,0.00005180856,0.8525009,0.06660382,0.0627457,0.01619484,0.00005966997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09452011,0.0004875644,0.90091,0.000141127,0.00004034782,0.0000856912,0.00007201933,0.0003786362,0.003364528],"genre_scores_gemma":[0.7199098,0.0004334466,0.2771861,0.00007084728,0.00005391026,0.0001720612,0.0001471229,0.00006549629,0.001961183],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0008917098,"threshold_uncertainty_score":0.004715919,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03558437949558501,"score_gpt":0.2682731998395687,"score_spread":0.2326888203439836,"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."}}