{"id":"W2475918252","doi":"10.1109/isit.1991.695198","title":"Burst And Unidirectional Error Detecting Codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Upper and lower bounds; Minimum distance; Burst error; Computer science; Error detection and correction; Algorithm; Mathematics; Discrete mathematics; Combinatorics","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.0001844435,0.00004725573,0.00004286422,0.00005775203,0.0001485625,0.00007209289,0.0001460722,0.00001735529,0.00003442392],"category_scores_gemma":[0.00001304224,0.00004135674,0.00002199488,0.0001717747,0.00002850747,0.0002183657,0.00007390867,0.00004798293,0.00001307662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005710406,"about_ca_system_score_gemma":0.000006953633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006216354,"about_ca_topic_score_gemma":0.00003230388,"domain_scores_codex":[0.9996113,0.00002242435,0.00005810942,0.0001441417,0.00006540401,0.00009857868],"domain_scores_gemma":[0.9997333,0.00007970184,0.00001485555,0.0001158186,0.00001682224,0.00003955363],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000004417358,0.00002325751,0.001579894,0.000002733238,0.00001066014,0.000001176141,0.0002909961,0.00004866462,0.001327348,0.7047923,0.000207718,0.2917108],"study_design_scores_gemma":[0.001587106,0.0005160366,0.03421211,0.00007587505,0.000029636,0.0005243008,0.0006028981,0.2815145,0.08877702,0.2500073,0.3406637,0.001489492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4080105,0.0001955803,0.5565658,0.001836574,0.0001802125,0.00004934253,4.73605e-7,0.0004767857,0.03268466],"genre_scores_gemma":[0.9522646,0.000003335322,0.04714165,0.0002590683,0.00006141229,0.000001992135,9.089855e-8,0.0000018567,0.0002659844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5442541,"threshold_uncertainty_score":0.1686479,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01609292070455374,"score_gpt":0.240179879028569,"score_spread":0.2240869583240153,"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."}}