{"id":"W2140508448","doi":"10.1109/vetecs.2008.249","title":"A New Approach for the Construction of Powerful LDPC Convolutional Codes","year":2008,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Low-density parity-check code; Turbo code; Convolutional code; Serial concatenated convolutional codes; Computer science; Orthogonality; Forward error correction; Tanner graph; Linear code; Algorithm; Theoretical computer science; Concatenated error correction code; Block code; Error floor; Discrete mathematics; Mathematics; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002137378,0.00006836582,0.00009793565,0.00004722397,0.0001133369,0.00001428721,0.0005055342,0.00003913366,0.00002026642],"category_scores_gemma":[0.00007281315,0.00004753611,0.00006521343,0.0001907731,0.0001186666,0.000145583,0.00008577791,0.00006308766,0.000003912363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002148047,"about_ca_system_score_gemma":0.0001564618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001416765,"about_ca_topic_score_gemma":0.00000552593,"domain_scores_codex":[0.9993585,0.000021384,0.000152431,0.0001854595,0.000164194,0.0001180178],"domain_scores_gemma":[0.9991814,0.0002588226,0.00008148461,0.000323038,0.0001253204,0.00002993416],"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.00002501363,0.00006589223,0.003993916,0.00001815091,0.00004324395,6.562579e-7,0.0009616786,0.0001846489,0.001833541,0.8957354,0.07373351,0.02340435],"study_design_scores_gemma":[0.001207933,0.0003933485,0.007352928,0.00002950912,0.00003383941,0.001323097,0.0004581122,0.8279248,0.09606521,0.04811001,0.01651482,0.000586358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00126304,0.00006058891,0.9890289,0.0004265089,0.0001884849,0.0002357551,0.000001381776,0.0002587801,0.008536595],"genre_scores_gemma":[0.2396681,0.000007928759,0.7591691,0.00007414573,0.00003715922,0.000010401,0.000001042515,0.000003352764,0.001028775],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8476254,"threshold_uncertainty_score":0.1938466,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03567444933081305,"score_gpt":0.2630555545990012,"score_spread":0.2273811052681881,"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."}}