{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001833507,0.0006568177,0.001078183,0.001841821,0.001638525,0.001912673,0.0008901843,0.002114603,0.003598908],"category_scores_gemma":[0.02204111,0.0007454377,0.0007711841,0.001680803,0.002609201,0.003953501,0.002320073,0.001683009,0.001065156],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003722126,"about_ca_system_score_gemma":0.0006831305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001770395,"about_ca_topic_score_gemma":0.0001355313,"domain_scores_codex":[0.9974485,0.0006225212,0.0002090681,0.0004976516,0.0008487986,0.0003734801],"domain_scores_gemma":[0.9714145,0.01494094,0.003502171,0.005393615,0.003180047,0.001568684],"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.00160305,0.0002379574,0.01234761,0.0004277298,0.0001657765,0.001495273,0.001130457,0.03316651,0.0348661,0.8201042,0.005109881,0.0893454],"study_design_scores_gemma":[0.0002329124,0.0007355884,0.005263216,0.0001567352,0.0001055573,0.004521501,0.00059093,0.1445649,0.05518189,0.7735801,0.01489183,0.0001747911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6634348,0.0006869644,0.3102607,0.001065753,0.0002346578,0.000119355,0.0004853639,0.0008901394,0.02282232],"genre_scores_gemma":[0.9504191,0.0004215076,0.04158073,0.0004586308,0.0002674249,0.000262312,0.000658955,0.0001920762,0.005739256],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003598908,"threshold_uncertainty_score":0.01203954,"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."}}