{"id":"W2031570691","doi":"10.1109/tcomm.2009.04.070114","title":"On decoding binary perfect and quasi-perfect codes over markov noise channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Decoding methods; Hamming bound; Hamming code; Algorithm; Block code; Binary symmetric channel; Mathematics; Linear code; Sequential decoding; List decoding; Markov chain; Concatenated error correction code; Hamming distance; Discrete mathematics; Computer science; Low-density parity-check code; Statistics","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.002559391,0.0006548786,0.0009083257,0.000574469,0.0005363032,0.001275383,0.0007451458,0.001147673,0.001050289],"category_scores_gemma":[0.01688872,0.0003930559,0.0003316597,0.001167497,0.002805453,0.003065136,0.001655282,0.0009445969,0.000244903],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001153334,"about_ca_system_score_gemma":0.001641127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002348812,"about_ca_topic_score_gemma":0.001556571,"domain_scores_codex":[0.997806,0.001041518,0.0001054911,0.0002111847,0.0005197277,0.0003161234],"domain_scores_gemma":[0.986464,0.01126648,0.0008745826,0.0005105877,0.0007287278,0.0001556283],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000359276,0.00003679431,0.001059716,0.000181821,0.00002542725,0.0002894184,0.0002895546,0.7219123,0.004551795,0.2548214,0.0006028012,0.01586984],"study_design_scores_gemma":[0.00003371613,0.00007155882,0.0002368147,0.00002130991,0.000006786858,0.0001122424,0.00005121873,0.8869855,0.002387972,0.1098423,0.0002314642,0.00001912731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.158719,0.0005417701,0.8352423,0.0006365007,0.0000492164,0.00005057301,0.000135569,0.0001013511,0.004523642],"genre_scores_gemma":[0.9236093,0.0009508691,0.07223704,0.0001636889,0.00007836012,0.00008106975,0.0001698803,0.00004557104,0.002664245],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002559391,"threshold_uncertainty_score":0.0135355,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01847512772185666,"score_gpt":0.2779605272010587,"score_spread":0.259485399479202,"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."}}