{"id":"W2148482408","doi":"10.1109/isit.1994.395018","title":"Search procedures for very low rate quasi-optimal convolutional codes","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Convolutional code; Computer science; Serial concatenated convolutional codes; Algorithm; Turbo code; Concatenated error correction code; Block code; 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.0003435067,0.00009534838,0.0001306453,0.0000434176,0.0001361125,0.0001172934,0.0004046244,0.00003663716,0.0001352781],"category_scores_gemma":[0.0001191421,0.00007358262,0.00006916413,0.0002020352,0.00006592728,0.0002478054,0.00009787108,0.0000753483,0.00009010055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001925426,"about_ca_system_score_gemma":0.00004358024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009546816,"about_ca_topic_score_gemma":6.906305e-7,"domain_scores_codex":[0.9990014,0.00006872316,0.0001383076,0.0003001908,0.0001803948,0.0003109335],"domain_scores_gemma":[0.9992131,0.0003697569,0.00002422117,0.0001811425,0.0001070805,0.0001046882],"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.00004519644,0.001090563,0.0005457141,0.0001956543,0.00008354836,0.0000200597,0.0006045965,0.001194532,0.007069454,0.5209162,0.03774449,0.43049],"study_design_scores_gemma":[0.0003432668,0.0002372742,0.0005530303,0.000010621,0.000002080565,0.000009208175,0.00001896211,0.9853026,0.005259328,0.004297234,0.003801826,0.0001645958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003306385,0.0001173079,0.9933892,0.001848757,0.0001917665,0.0001699923,0.000005392221,0.0001171084,0.0008540522],"genre_scores_gemma":[0.08181481,0.00001805959,0.9140359,0.0006721786,0.0001570646,0.00004047333,0.00000127977,0.00000686939,0.003253354],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.984108,"threshold_uncertainty_score":0.3000612,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04367447039761001,"score_gpt":0.3073676773293155,"score_spread":0.2636932069317054,"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."}}