{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002828359,0.00007606313,0.0001245824,0.0001010338,0.0001310986,0.00003106911,0.0003602649,0.00003786972,0.0001223591],"category_scores_gemma":[0.00009754468,0.0000626078,0.00007895039,0.0002677483,0.00005411013,0.0001673749,0.000093875,0.0001374709,0.00001605624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000994473,"about_ca_system_score_gemma":0.000003070747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001091895,"about_ca_topic_score_gemma":0.00001845757,"domain_scores_codex":[0.999234,0.0001374016,0.0001936084,0.0001702419,0.0001283243,0.000136385],"domain_scores_gemma":[0.9989108,0.0006015637,0.00005966287,0.0003466099,0.0000324032,0.00004893976],"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.000002224534,0.00009450295,0.3446489,0.00003027131,0.00003306869,7.954153e-7,0.01077705,0.00003609341,0.0001418858,0.6089767,0.0005613448,0.03469717],"study_design_scores_gemma":[0.0009750136,0.0005437828,0.3635206,0.0001920135,0.00006729877,0.00002472297,0.004242294,0.06099318,0.02113535,0.5452309,0.002033382,0.00104139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7526686,0.00004792089,0.2336848,0.000298886,0.0001162479,0.00005680195,0.000001646887,0.0001579708,0.01296722],"genre_scores_gemma":[0.9950334,0.000001413781,0.004418141,0.00001675959,0.00002685002,0.000004358009,3.880281e-7,0.000003306141,0.0004954126],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2423648,"threshold_uncertainty_score":0.2553072,"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."}}