{"id":"W2145728281","doi":"10.1109/ftcs.1991.146689","title":"Burst and unidirectional error detecting codes","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Minimum distance; Upper and lower bounds; Computer science; Combinatorics; Probability of error; Discrete mathematics; Algorithm; Mathematics","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.0001271705,0.00004769361,0.00004408054,0.00005875661,0.0001625676,0.00007653279,0.0001448374,0.00001757956,0.0001102305],"category_scores_gemma":[0.00001608486,0.00004180424,0.00002256505,0.0002146627,0.00003187685,0.0001655712,0.0000677041,0.00004842266,0.0000183507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003682865,"about_ca_system_score_gemma":0.000001706251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006157393,"about_ca_topic_score_gemma":0.000008605701,"domain_scores_codex":[0.9996065,0.00002530883,0.00005448679,0.0001475818,0.0000672022,0.00009891127],"domain_scores_gemma":[0.9997192,0.00008827705,0.00001457139,0.0001230113,0.00001556972,0.00003939254],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002751477,0.00004249884,0.002932071,0.000005907714,0.00001750399,0.000005409899,0.0005948863,0.00001478057,0.001153564,0.7881458,0.0007298293,0.206355],"study_design_scores_gemma":[0.001390992,0.000655538,0.01960479,0.00007812147,0.00002827146,0.0006112397,0.0005822052,0.5417297,0.02555484,0.3001062,0.108241,0.001417106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3652382,0.0005036477,0.5385972,0.001483302,0.0004184128,0.00007710241,7.561816e-7,0.0007504186,0.09293093],"genre_scores_gemma":[0.9847602,0.00000758137,0.01453938,0.000167779,0.00002804512,0.000002080358,5.146714e-8,0.000001943269,0.0004930004],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6195219,"threshold_uncertainty_score":0.1704727,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02785623601245468,"score_gpt":0.2253832174901213,"score_spread":0.1975269814776666,"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."}}