{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008729816,0.0004038255,0.0003595066,0.0006883948,0.0005537721,0.0006175705,0.0005928077,0.0004601815,0.0008647651],"category_scores_gemma":[0.001980936,0.0002791609,0.0004982385,0.0004403357,0.0009222395,0.0006436917,0.001133368,0.0008709954,0.0004468208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003744317,"about_ca_system_score_gemma":0.0006341938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003214408,"about_ca_topic_score_gemma":0.0002596187,"domain_scores_codex":[0.999472,0.0001594374,0.00002220573,0.0000576772,0.0002232799,0.00006544995],"domain_scores_gemma":[0.999363,0.0002356026,0.00007862482,0.0001828441,0.0001013704,0.0000385429],"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.0001028675,0.00004367965,0.0007507018,0.000164558,0.000016043,0.0004364513,0.0002912903,0.06959845,0.03285781,0.8434036,0.0008583579,0.05147619],"study_design_scores_gemma":[0.00008225667,0.0003040539,0.0004922118,0.0001034061,0.00003324601,0.0008384608,0.00008101591,0.5149485,0.07756577,0.3815002,0.02396256,0.00008836684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04522646,0.0003098069,0.9482121,0.0001151706,0.0000414142,0.00008138255,0.00006781983,0.0002071109,0.005738732],"genre_scores_gemma":[0.5047185,0.000753061,0.4908448,0.0001142191,0.00006505816,0.0002122671,0.0002520207,0.0001016707,0.00293849],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0008729816,"threshold_uncertainty_score":0.004616857,"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."}}