{"id":"W2884285234","doi":"10.1109/itw.1998.706467","title":"Relationships between different error-correcting capabilities of a code","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge","funders":"University of Lethbridge","keywords":"Hamming distance; Error detection and correction; Hamming code; Computer science; Algorithm; Levenshtein distance; Channel (broadcasting); Code (set theory); Type (biology); Mathematics; Topology (electrical circuits); Combinatorics; Block code; Decoding methods; 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.003072475,0.001046004,0.0006295168,0.004416963,0.001405764,0.004281919,0.001077166,0.001772671,0.00274709],"category_scores_gemma":[0.03439351,0.000730707,0.0006022778,0.002462795,0.005244859,0.008786498,0.003761347,0.002851799,0.0004628193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001433283,"about_ca_system_score_gemma":0.00132705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004167685,"about_ca_topic_score_gemma":0.0004038352,"domain_scores_codex":[0.9949758,0.001226504,0.0005188193,0.0009711224,0.00157631,0.0007314752],"domain_scores_gemma":[0.9301655,0.04616249,0.007873887,0.006387494,0.007047046,0.002363602],"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.0001899096,0.00006278465,0.004229061,0.0001304273,0.00004897719,0.0003898891,0.0004889303,0.01603692,0.006618486,0.9493166,0.0004166908,0.02207147],"study_design_scores_gemma":[0.00002612048,0.0001410025,0.002213064,0.00008218129,0.00006300997,0.001178028,0.0003145086,0.06751874,0.01635415,0.9075792,0.004403223,0.0001267376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5416034,0.001232405,0.4149891,0.001079538,0.0001453962,0.0001518854,0.00068369,0.0006209097,0.03949362],"genre_scores_gemma":[0.9551915,0.0005332234,0.04191782,0.0001198177,0.0000770815,0.00008728941,0.0001732106,0.00005103417,0.001849027],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004416963,"threshold_uncertainty_score":0.01624894,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08557244224298977,"score_gpt":0.2492534551778942,"score_spread":0.1636810129349044,"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."}}