{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009364874,0.0004191337,0.000529722,0.0009387971,0.0002424702,0.0002272032,0.003012218,0.0002544103,0.00002770175],"category_scores_gemma":[0.00004612257,0.0003987144,0.0002284112,0.0008340501,0.001007078,0.0004113737,0.0007453681,0.0005111088,0.00001353355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009881829,"about_ca_system_score_gemma":0.0002406113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004913211,"about_ca_topic_score_gemma":0.00001211849,"domain_scores_codex":[0.9970754,0.00007145474,0.0005165437,0.001126525,0.0007212989,0.0004887425],"domain_scores_gemma":[0.9972002,0.0004188355,0.00032343,0.001672785,0.000242509,0.0001422221],"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.000009870208,0.00008782648,0.00005800411,0.00005692986,0.00003453997,0.00003827578,0.0006446263,0.005193606,0.001817816,0.6109139,0.00004933607,0.3810952],"study_design_scores_gemma":[0.0002326579,0.0002764582,0.00009239878,0.0005042677,0.000017976,0.00008920255,1.139802e-7,0.02789059,0.01933457,0.9482322,0.002690318,0.0006392173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001701535,0.000604141,0.9915009,0.0003423682,0.000873037,0.0002676317,0.000007447263,0.0001235146,0.006110818],"genre_scores_gemma":[0.154209,0.00005576302,0.8442361,0.001080908,0.0001607712,0.00001017113,0.000005471417,0.00003523673,0.0002065496],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.380456,"threshold_uncertainty_score":0.9998465,"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."}}