{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002380461,0.0002923369,0.0002745238,0.0002412842,0.0008209355,0.0000711912,0.001005325,0.0001502603,0.0000766089],"category_scores_gemma":[0.000008082634,0.0003180459,0.000167992,0.0003259242,0.0001632208,0.00049371,0.000009715768,0.0005730981,0.00004997819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003358981,"about_ca_system_score_gemma":0.00006019535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006862873,"about_ca_topic_score_gemma":0.0004469412,"domain_scores_codex":[0.9987254,0.00009374171,0.000494049,0.0002301676,0.0001564003,0.0003002],"domain_scores_gemma":[0.997022,0.000792538,0.00008869261,0.001744435,0.0002481598,0.000104154],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008310857,0.0008020027,0.00002050776,0.00006938164,0.0005035504,3.873288e-7,0.00125172,0.8602418,0.01739452,0.09127588,0.003415129,0.02494195],"study_design_scores_gemma":[0.00147138,0.0001137467,0.0001481187,0.000137929,0.0001380375,0.00001355905,0.00009864325,0.8137167,0.1036401,0.007424321,0.07224777,0.0008497302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003651999,0.0005999925,0.9893641,0.002053726,0.0001864083,0.000729276,0.00042519,0.002008784,0.0009804822],"genre_scores_gemma":[0.7494479,0.001520309,0.2474461,0.0001560301,0.00004248996,0.001093378,0.00009926996,0.00005783124,0.0001366056],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.745796,"threshold_uncertainty_score":0.9999272,"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."}}