{"id":"W2168020874","doi":"10.1109/tcomm.2004.840639","title":"High-Rate Punctured Convolutional Self-Doubly Orthogonal Codes for Iterative Threshold Decoding","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Convolutional code; Puncturing; Sequential decoding; Serial concatenated convolutional codes; Algorithm; Decoding methods; Turbo code; Viterbi decoder; Concatenated error correction code; Computer science; List decoding; Linear code; Mathematics; 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.0004859762,0.0003517215,0.0003346826,0.0002699809,0.0002174824,0.0004483611,0.0003483858,0.0003771628,0.0007412533],"category_scores_gemma":[0.003044868,0.0001463178,0.0002985382,0.0004100083,0.0005771987,0.0004536359,0.0003699541,0.0004702895,0.0002758595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004750773,"about_ca_system_score_gemma":0.0005834269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003854346,"about_ca_topic_score_gemma":0.0004715497,"domain_scores_codex":[0.9995887,0.0001356235,0.00002550063,0.00003071976,0.0001913226,0.00002814526],"domain_scores_gemma":[0.9982351,0.001041831,0.0002097336,0.0002363517,0.0002474301,0.00002966552],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003556503,0.00005894716,0.003270437,0.0005328648,0.00007116755,0.00062905,0.0005549243,0.171329,0.4357307,0.2205412,0.001335105,0.1655909],"study_design_scores_gemma":[0.00001980118,0.0002518307,0.001022954,0.00006258957,0.00003708468,0.001058603,0.00003458849,0.6698298,0.3021301,0.01887116,0.006639366,0.00004199937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08462987,0.0006059414,0.9102143,0.00007046789,0.00002290827,0.00005454599,0.00004124688,0.0002654733,0.004095214],"genre_scores_gemma":[0.6217411,0.0006300993,0.375565,0.00004989392,0.00002435439,0.00007269131,0.00009692225,0.00007324586,0.001746546],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0007412533,"threshold_uncertainty_score":0.003446937,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02715290677308701,"score_gpt":0.2813389561534958,"score_spread":0.2541860493804088,"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."}}