{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000819938,0.000332021,0.0004511614,0.0008225517,0.0003776268,0.0006685309,0.0006205261,0.0006488758,0.005418164],"category_scores_gemma":[0.005345433,0.0004249695,0.0003343376,0.0006510278,0.0008584387,0.0007845568,0.00100916,0.0005390266,0.000899006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006815967,"about_ca_system_score_gemma":0.001136275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001945234,"about_ca_topic_score_gemma":0.002873792,"domain_scores_codex":[0.9996382,0.0001283034,0.00002110899,0.0000424295,0.0001166586,0.00005330716],"domain_scores_gemma":[0.9984126,0.001047858,0.0001359333,0.00008702082,0.0002633308,0.00005330114],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003390188,0.00005944711,0.001403686,0.0002421618,0.00004381474,0.0001573142,0.0001793924,0.622555,0.01318247,0.1865202,0.004792877,0.1705246],"study_design_scores_gemma":[0.00004342841,0.00004835004,0.0001747125,0.00001707139,0.000008824692,0.0000470113,0.00002048289,0.9656228,0.002787937,0.0295657,0.001651557,0.00001200069],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03559966,0.0002134261,0.9576046,0.0001690038,0.00002879786,0.00005455173,0.00009847737,0.0003175643,0.00591382],"genre_scores_gemma":[0.3731669,0.0002512816,0.6177658,0.0001453069,0.00004158826,0.0002679248,0.0003755528,0.0002807405,0.007704942],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005418164,"threshold_uncertainty_score":0.01812553,"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."}}