{"id":"W4239741176","doi":"10.1007/3-540-44977-9_8","title":"Prime Decompositions of Regular Prefix Codes","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Prefix; Prefix code; Prime (order theory); Computer science; Automaton; Decomposition; Code (set theory); Discrete mathematics; Theoretical computer science; Algorithm; Mathematics; Linear code; Combinatorics; Programming language; Block code; Decoding methods","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.0005880363,0.0005909225,0.000632541,0.001631212,0.0009668827,0.0021154,0.0005043629,0.0004873094,0.007497051],"category_scores_gemma":[0.001906287,0.0004926503,0.0006114703,0.00140531,0.001690236,0.002661806,0.001390243,0.002032101,0.001846988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009132579,"about_ca_system_score_gemma":0.0006472635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004028,"about_ca_topic_score_gemma":0.0004117274,"domain_scores_codex":[0.9995772,0.00008638516,0.00002324648,0.00006779207,0.0001670197,0.00007835907],"domain_scores_gemma":[0.9992248,0.0003112212,0.00008241736,0.000149901,0.0001263735,0.0001053121],"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.00002975577,0.000009764933,0.00006089752,0.00002041643,0.000002688111,0.00003078414,0.0001117751,0.0007968376,0.000753507,0.9846428,0.001568238,0.01197263],"study_design_scores_gemma":[0.000007086994,0.00001195015,0.00006480401,0.000009546111,0.000003958601,0.0000737628,0.00002712169,0.002465772,0.0005493541,0.9911663,0.005614463,0.000005919192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2725323,0.002912828,0.4375162,0.001500362,0.0007113317,0.0001883643,0.0007678248,0.0006392953,0.2832316],"genre_scores_gemma":[0.7369312,0.003080526,0.13248,0.0005569737,0.0008191162,0.0002489188,0.001072705,0.0005524564,0.1242582],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007497051,"threshold_uncertainty_score":0.02508008,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0115768207749095,"score_gpt":0.2315566761640496,"score_spread":0.2199798553891401,"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."}}