{"id":"W2113217811","doi":"10.1109/lcomm.2005.1576587","title":"Construction of low-density parity-check convolutional codes through progressive edge-growth","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Computer science; Serial concatenated convolutional codes; Algorithm; Turbo code; Convolutional code; Enhanced Data Rates for GSM Evolution; Parity-check matrix; Parity bit; Decoding methods; Theoretical computer science; Concatenated error correction code; Block code; 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.0002595551,0.0003315507,0.0002455871,0.0004290841,0.00032048,0.0002957182,0.0005598355,0.0003514302,0.0006927519],"category_scores_gemma":[0.001087943,0.0001394306,0.0002639586,0.0003504652,0.0005000219,0.0006026398,0.0006603971,0.0006063152,0.0002704482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000278576,"about_ca_system_score_gemma":0.0006002611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008093705,"about_ca_topic_score_gemma":0.0009352427,"domain_scores_codex":[0.999824,0.00003657986,0.000007410546,0.00002508641,0.00008008588,0.00002692845],"domain_scores_gemma":[0.9996064,0.0001516498,0.00003740973,0.00008354635,0.00009901714,0.00002198274],"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.0002858374,0.0001113745,0.002333469,0.0003688546,0.00004336111,0.0007493548,0.0002977796,0.2334301,0.1667314,0.3093966,0.002454984,0.2837968],"study_design_scores_gemma":[0.00004360821,0.0001190858,0.0004553484,0.00002433346,0.00001958576,0.000404007,0.0000246526,0.835129,0.1178063,0.03673328,0.009206172,0.00003464199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07242082,0.0001930967,0.9217335,0.000129717,0.00004813331,0.00006959612,0.00006743699,0.0004792758,0.004858421],"genre_scores_gemma":[0.5180641,0.0003505826,0.4777238,0.00009824828,0.00002299296,0.0001009284,0.0002113841,0.00006433774,0.003363597],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0008093705,"threshold_uncertainty_score":0.002317488,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02752955656243392,"score_gpt":0.2893661569369521,"score_spread":0.2618366003745181,"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."}}