{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004342187,0.0004418271,0.0003106747,0.0008301214,0.0005317025,0.001175701,0.0004012696,0.0006297391,0.004022041],"category_scores_gemma":[0.003094684,0.0001918693,0.0001759387,0.0009992493,0.000885178,0.00102209,0.001224447,0.0009400719,0.0008821751],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007107919,"about_ca_system_score_gemma":0.0004363323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001087766,"about_ca_topic_score_gemma":0.0007445691,"domain_scores_codex":[0.9995226,0.00009887485,0.00003567552,0.00008697942,0.0001546761,0.0001012605],"domain_scores_gemma":[0.9985952,0.0006088724,0.0002168575,0.0002350178,0.0002683522,0.00007571616],"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.0009874654,0.00005562752,0.002952863,0.0002719017,0.00002683919,0.0003409281,0.0003538493,0.03722449,0.0319142,0.7128358,0.006734298,0.2063017],"study_design_scores_gemma":[0.0001512675,0.0003516582,0.002469433,0.0001922415,0.00003390203,0.0009691777,0.0001852813,0.3317947,0.0562975,0.5734951,0.0339687,0.00009104126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2093218,0.002757058,0.7522303,0.0009348426,0.0002654205,0.0001020177,0.0007651013,0.0005489967,0.03307441],"genre_scores_gemma":[0.8453578,0.001196524,0.1380139,0.000396276,0.0001414204,0.0001310215,0.0004722661,0.00009266038,0.01419822],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004022041,"threshold_uncertainty_score":0.01345503,"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."}}