{"id":"W1504657239","doi":"10.1109/pimrc.2004.1368787","title":"Efficient list decoding for parallel concatenated convolutional codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Partenariat Canadien Contre Le Cancer; University of Alberta","keywords":"Concatenated error correction code; Convolutional code; Serial concatenated convolutional codes; Computer science; List decoding; Sequential decoding; Algorithm; Turbo code; Decoding methods; Block code; Linear code; Additive white Gaussian noise; Frame (networking); BCJR algorithm; Focus (optics); Theoretical computer science; Channel (broadcasting); Telecommunications","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001085504,0.0007643673,0.0006922705,0.001059328,0.0006574516,0.001038692,0.000788867,0.000584373,0.001494287],"category_scores_gemma":[0.005390764,0.0003243477,0.0003331266,0.001406149,0.0005700062,0.001428123,0.0008903566,0.0005855355,0.0009844862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001143503,"about_ca_system_score_gemma":0.001769901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002191228,"about_ca_topic_score_gemma":0.004215446,"domain_scores_codex":[0.9986953,0.0003238557,0.0001018079,0.0001124178,0.0006183975,0.0001482683],"domain_scores_gemma":[0.9969523,0.001364559,0.0003281943,0.0004368317,0.0008520063,0.00006603076],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007254225,0.00008355467,0.00163137,0.0002836961,0.00007872603,0.0003084904,0.0001972569,0.39874,0.0536213,0.07375097,0.005676673,0.4649025],"study_design_scores_gemma":[0.00002798523,0.000105273,0.000278338,0.00002423408,0.00002135705,0.0002186401,0.00002003915,0.9267619,0.0482771,0.02035122,0.00388255,0.0000313679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02831118,0.0004234453,0.967796,0.0001372665,0.00005105873,0.0000481022,0.0001133046,0.0008227284,0.002296964],"genre_scores_gemma":[0.3090863,0.0007086996,0.6834723,0.0001669327,0.0001243621,0.0001180899,0.0005407076,0.000204807,0.00557793],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002191228,"threshold_uncertainty_score":0.008296728,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01863114506261961,"score_gpt":0.2701280793847783,"score_spread":0.2514969343221587,"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."}}