{"id":"W2153149491","doi":"10.1109/cwit.2007.375726","title":"On Decoding Binary Quasi-Perfect Codes Over Markov Noise Channels","year":2007,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Decoding methods; Hamming code; Binary symmetric channel; Linear code; Block code; Algorithm; Hamming distance; Hamming bound; Markov chain; Computer science; Sequential decoding; Hamming weight; Mathematics; Binary code; Binary number; Low-density parity-check code; Statistics; Arithmetic","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.002370941,0.000761328,0.0009350005,0.0006171354,0.0006151859,0.001199942,0.0008474414,0.001254032,0.0009730291],"category_scores_gemma":[0.01342486,0.0004474575,0.0003507814,0.001246983,0.003033571,0.002947952,0.00154857,0.001130111,0.0002554427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001264243,"about_ca_system_score_gemma":0.001390835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002473089,"about_ca_topic_score_gemma":0.001501204,"domain_scores_codex":[0.9977998,0.00112845,0.00007782478,0.0001720505,0.0004845608,0.0003372742],"domain_scores_gemma":[0.9872799,0.0108501,0.0007706219,0.000414065,0.0005452295,0.000139985],"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.0003337343,0.00003467593,0.0008572204,0.0001518166,0.00002407888,0.0002602057,0.0002524522,0.7622347,0.005388991,0.2191322,0.0005403034,0.01078954],"study_design_scores_gemma":[0.00002932352,0.00005243549,0.0001378788,0.00001439468,0.000005332331,0.00006927468,0.00002919811,0.9262362,0.001834628,0.0714318,0.000144139,0.00001537872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1859107,0.0005411486,0.8086553,0.0007428089,0.00005596852,0.00004801433,0.000113802,0.0001447858,0.003787343],"genre_scores_gemma":[0.9405091,0.0008945923,0.05563892,0.0001529572,0.0000860314,0.00007592345,0.0001266477,0.00005350473,0.002462275],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002473089,"threshold_uncertainty_score":0.01253885,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01271878368253299,"score_gpt":0.2566338233815766,"score_spread":0.2439150396990437,"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."}}