{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007570829,0.0005217044,0.0004103254,0.001141617,0.000619348,0.001250287,0.0006362988,0.0007351019,0.002067363],"category_scores_gemma":[0.004777111,0.0002912057,0.0002014992,0.001200013,0.0008289456,0.001188204,0.001832609,0.0009775124,0.0006488631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006483896,"about_ca_system_score_gemma":0.0008127824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008323241,"about_ca_topic_score_gemma":0.0006196706,"domain_scores_codex":[0.9990115,0.0001993019,0.00008453874,0.0001668518,0.0003418087,0.0001959971],"domain_scores_gemma":[0.9970921,0.001135469,0.0005020006,0.0005301137,0.0005769341,0.0001633137],"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.001870839,0.00009373522,0.004110647,0.0003521228,0.00004137739,0.0002707598,0.0004674181,0.06466985,0.05031186,0.6443638,0.004495276,0.2289524],"study_design_scores_gemma":[0.0002576595,0.0004973318,0.002045329,0.0001989239,0.0000673696,0.0008606073,0.0002115965,0.4292112,0.08404917,0.4585454,0.02393975,0.0001156146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1979973,0.001571689,0.7823189,0.0004466762,0.0001561232,0.0001491204,0.000640561,0.0004588022,0.01626083],"genre_scores_gemma":[0.8035104,0.000984172,0.1849837,0.0003142823,0.000123769,0.0002276974,0.0005329186,0.00009447541,0.009228576],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002067363,"threshold_uncertainty_score":0.006915987,"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."}}