{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009266931,0.0002517111,0.0002905463,0.0001824326,0.000320179,0.0002876797,0.001224597,0.00006716474,0.000006763503],"category_scores_gemma":[0.0002005164,0.000232042,0.0001403102,0.0003311222,0.00006705218,0.0007718088,0.0002613603,0.0002187128,0.00002454196],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001344227,"about_ca_system_score_gemma":0.0001096939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003350601,"about_ca_topic_score_gemma":0.00007505478,"domain_scores_codex":[0.9982533,0.00006766865,0.0003141898,0.0006250323,0.0002471886,0.0004926617],"domain_scores_gemma":[0.9985857,0.0001952488,0.0001256171,0.0008302398,0.000149782,0.0001134164],"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.00001724216,0.0003159732,0.0008012716,0.0001368101,0.0000642283,0.00001433066,0.00169434,0.001540228,0.0357286,0.9374443,0.003627256,0.01861545],"study_design_scores_gemma":[0.0006718299,0.0001996663,0.0001834732,0.00008677251,0.00001205546,0.00005524579,0.00006652452,0.06944883,0.7803032,0.1431675,0.005240415,0.0005644533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1316816,0.00004589199,0.8616014,0.0009221895,0.0002792781,0.0004628023,0.000002715405,0.00194949,0.003054651],"genre_scores_gemma":[0.531425,0.000001755147,0.4679599,0.0003025136,0.00004281528,0.00006236048,0.000002815024,0.00001604695,0.0001867171],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7942768,"threshold_uncertainty_score":0.9462397,"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."}}