{"id":"W2112113416","doi":"10.1109/vetecs.2007.414","title":"Performance Comparison of Iterative BP and Threshold Decoding for Convolutional Self-Doubly-Orthogonal Codes","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Sequential decoding; Convolutional code; List decoding; Computer science; Algorithm; Berlekamp–Welch algorithm; Serial concatenated convolutional codes; Additive white Gaussian noise; Convergence (economics); Concatenated error correction code; Channel (broadcasting); Theoretical computer science; Telecommunications; Block code","routes":{"ca_aff":true,"ca_fund":true,"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.0007623077,0.0001245921,0.000207597,0.0001269931,0.0001579621,0.00004642336,0.0003233507,0.00005839983,0.000004761992],"category_scores_gemma":[0.00002876464,0.0001140635,0.00004458783,0.0001796879,0.00006695908,0.0004069413,0.000155185,0.0001087073,0.000001160183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004231719,"about_ca_system_score_gemma":0.00005104477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006955676,"about_ca_topic_score_gemma":0.00004990935,"domain_scores_codex":[0.9989116,0.00001317093,0.0003352249,0.0002810144,0.0002126136,0.0002463367],"domain_scores_gemma":[0.9990038,0.0003771905,0.0001445863,0.0001914958,0.0002220843,0.0000608698],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008302458,0.0001992305,0.6631311,0.0001173593,0.00004865596,0.000001468186,0.003967146,0.00008983819,0.00560264,0.3004841,0.00168699,0.02458847],"study_design_scores_gemma":[0.0003835626,0.0003276958,0.02301519,0.00005541782,0.000008207164,0.00002088933,0.0000814372,0.8814645,0.09230869,0.001720283,0.0003991417,0.0002149446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4837476,0.00005264684,0.5138625,0.00005202137,0.00009338254,0.0001549678,0.000001697086,0.000228875,0.001806317],"genre_scores_gemma":[0.6615314,0.000003526567,0.3383221,0.00006573517,0.00002344388,0.000008764228,0.000001785649,0.000004398641,0.00003882184],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8813747,"threshold_uncertainty_score":0.4651375,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03676323783177058,"score_gpt":0.3262450077799744,"score_spread":0.2894817699482038,"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."}}