{"id":"W2111454628","doi":"10.1109/tit.2003.815803","title":"Almost all complete binary prefix codes have a self-synchronizing string","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"Communications Security Establishment","funders":"","keywords":"Prefix code; Synchronizing; Computer science; Binary number; Discrete mathematics; Theoretical computer science; Mathematics; Algorithm; Linear code; Block code; Arithmetic; Combinatorics; Decoding methods; Topology (electrical circuits)","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.0005193718,0.0001922681,0.0001550676,0.0002571066,0.0004613682,0.0002617735,0.000385111,0.0000850044,0.00009640669],"category_scores_gemma":[0.00000818712,0.0001777473,0.00008640444,0.0002382362,0.00003865602,0.003622002,0.000007246781,0.0002649942,0.0002782281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001120116,"about_ca_system_score_gemma":0.0000814182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001972335,"about_ca_topic_score_gemma":0.000002669349,"domain_scores_codex":[0.9986342,0.0001661441,0.0003914057,0.0001971771,0.0003190454,0.0002920654],"domain_scores_gemma":[0.9989045,0.0001741913,0.000148093,0.0005679132,0.00009178592,0.0001135244],"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.0001721783,0.0007615454,0.00002810285,0.0002712175,0.0003912717,0.00001812834,0.01896211,0.1765453,0.001167153,0.409065,0.002174339,0.3904436],"study_design_scores_gemma":[0.00237969,0.0005151812,0.0002173638,0.0002382029,0.00007126607,0.0001535928,0.0008504824,0.8240082,0.02243781,0.01185463,0.1361982,0.001075394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00258945,0.00003082143,0.9921247,0.0000543566,0.0005878769,0.0002400271,0.00005492058,0.0004120241,0.00390581],"genre_scores_gemma":[0.9333674,0.00006882978,0.06558789,0.0007175328,0.00002209938,0.00006327808,0.00002326264,0.00001286868,0.0001368751],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9307779,"threshold_uncertainty_score":0.7248325,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01931613686756095,"score_gpt":0.2361347392799324,"score_spread":0.2168186024123715,"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."}}