{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001160373,0.0001668792,0.0001471367,0.0002981602,0.0002053707,0.0001395746,0.0006421569,0.00006521248,0.0002016215],"category_scores_gemma":[0.00004135374,0.0001409218,0.0001346572,0.0005956024,0.00004589605,0.0003133498,0.0001794194,0.0001390364,0.00009698466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002631042,"about_ca_system_score_gemma":0.00001499931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001301354,"about_ca_topic_score_gemma":0.000009379671,"domain_scores_codex":[0.998717,0.0000677864,0.0001834928,0.0003914355,0.0002338966,0.0004063594],"domain_scores_gemma":[0.9987411,0.0005345703,0.00004794474,0.0005164426,0.00002846245,0.0001314819],"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.00009781298,0.0002431844,0.001167658,0.00001254256,0.00002489163,0.00007094162,0.0005124674,0.00004758266,0.003791743,0.9356752,0.002944025,0.05541195],"study_design_scores_gemma":[0.005283236,0.007463616,0.05023549,0.0006870239,0.00007854645,0.0002110198,0.0005836995,0.1969592,0.1974109,0.5158139,0.02051767,0.00475577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4807125,0.00004669214,0.4907666,0.0001471667,0.0006264669,0.00009134252,6.57237e-7,0.0003273352,0.02728128],"genre_scores_gemma":[0.9898318,0.00000857864,0.008538119,0.00111346,0.00009880851,0.000004211853,0.000001014947,0.000009788967,0.0003941999],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5091193,"threshold_uncertainty_score":0.5746625,"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."}}