{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002920228,0.000427249,0.0003169647,0.0007032985,0.0004827274,0.0005326091,0.0005896779,0.0003650775,0.001444772],"category_scores_gemma":[0.0009080077,0.0002257086,0.0003896531,0.0004969728,0.0007437358,0.0006583526,0.001151877,0.001170156,0.0006086857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003779116,"about_ca_system_score_gemma":0.0006335643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002938154,"about_ca_topic_score_gemma":0.0005307523,"domain_scores_codex":[0.9996629,0.00005918931,0.00001706256,0.00004671083,0.0001854036,0.00002872665],"domain_scores_gemma":[0.9996593,0.0000975294,0.00003198252,0.0000922668,0.00009277264,0.00002627262],"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.00008166335,0.00007844842,0.0006090974,0.0004570202,0.00004798032,0.0004232938,0.0002382331,0.03339138,0.1381143,0.6250228,0.002872894,0.1986629],"study_design_scores_gemma":[0.00009791333,0.000329059,0.0008141719,0.0001411832,0.00009371154,0.002325604,0.00005573929,0.4118229,0.1674406,0.2898095,0.126933,0.0001365214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009521605,0.000269921,0.9832159,0.0001034231,0.00006991699,0.00005611723,0.00005915104,0.000251363,0.006452524],"genre_scores_gemma":[0.1896425,0.001050389,0.8019807,0.0001443979,0.0001031324,0.0001918757,0.0002689835,0.00009861349,0.006519456],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001444772,"threshold_uncertainty_score":0.004833281,"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."}}