{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000340652,0.000166907,0.0002296702,0.0001227218,0.000345885,0.000064732,0.002339112,0.0000888683,0.000005965051],"category_scores_gemma":[0.0001193936,0.0001836773,0.0001032774,0.0004617116,0.000820687,0.0007490857,0.0005107403,0.0003878578,0.0000285372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001609054,"about_ca_system_score_gemma":0.0001023939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001157775,"about_ca_topic_score_gemma":0.00005789239,"domain_scores_codex":[0.9984663,0.0002797762,0.000422268,0.0003049786,0.0002880089,0.0002387191],"domain_scores_gemma":[0.996649,0.0003420965,0.0003687709,0.002188897,0.0004014964,0.0000497929],"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.00004956128,0.001558673,0.03835361,0.0001974242,0.0003335058,0.00001129473,0.009836971,0.0003781761,0.2074193,0.6533933,0.05657208,0.03189609],"study_design_scores_gemma":[0.001772424,0.0002310465,0.0224763,0.0008450244,0.0001264828,0.0005996934,0.0004560434,0.06755404,0.8576879,0.03404181,0.01230601,0.001903215],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2255604,0.0004548269,0.7336733,0.03683246,0.0004435681,0.0004706686,0.00001326401,0.0009025307,0.001648934],"genre_scores_gemma":[0.5911902,0.00005302302,0.4076714,0.0009790383,0.00004446948,0.00003861643,0.000008357509,0.000007680294,0.000007245671],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6502686,"threshold_uncertainty_score":0.7490143,"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."}}