{"id":"W2950467956","doi":"10.48550/arxiv.1204.2439","title":"Degenerate Viterbi decoding","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Intelligence Advanced Research Projects Activity; Fonds Québécois de la Recherche sur la Nature et les Technologies; Compute Canada","keywords":"Convolutional code; Algorithm; Sequential decoding; Decoding methods; Computer science; Degenerate energy levels; Viterbi decoder; Soft output Viterbi algorithm; Iterative Viterbi decoding; List decoding; Viterbi algorithm; Mathematics; Block code; Concatenated error correction code; Physics; Quantum mechanics","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.001563244,0.0005680282,0.001210243,0.001201222,0.0009968024,0.00180309,0.002149992,0.001644377,0.004848876],"category_scores_gemma":[0.00673517,0.0006189838,0.0006974533,0.001492672,0.0015589,0.001743613,0.00232686,0.001641865,0.002436159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001601291,"about_ca_system_score_gemma":0.001883343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002012445,"about_ca_topic_score_gemma":0.002127416,"domain_scores_codex":[0.9976038,0.000625018,0.0001398013,0.000462736,0.0008529897,0.0003154947],"domain_scores_gemma":[0.9980234,0.00054881,0.0001374481,0.0008199316,0.0003857297,0.00008480564],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003754889,0.0001188677,0.001259863,0.0001779466,0.00009052989,0.0001769073,0.0002747462,0.230408,0.01631272,0.5781925,0.007151362,0.165461],"study_design_scores_gemma":[0.00002680554,0.00002752808,0.0001414695,0.00001756288,0.00001419267,0.0001073913,0.000009823569,0.8244542,0.01105898,0.1590517,0.005062041,0.00002828874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0137094,0.0003464225,0.9749703,0.0004150493,0.0001090414,0.00007070312,0.0002072549,0.001032947,0.009138959],"genre_scores_gemma":[0.4620433,0.000474554,0.5232478,0.0006099067,0.0001562658,0.0002098892,0.0006680238,0.000308614,0.01228179],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004848876,"threshold_uncertainty_score":0.01622111,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05847697119351735,"score_gpt":0.1860317602168087,"score_spread":0.1275547890232914,"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."}}