{"id":"W4226238874","doi":"10.1016/j.tcs.2022.01.010","title":"Efficient and compact representations of some non-canonical prefix-free codes","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Prefix code; Code word; Lexicographical order; Prefix; ENCODE; Word (group theory); Constant (computer programming); Mathematics; Code (set theory); Decoding methods; Encoding (memory); Combinatorics; Discrete mathematics; Alphabet; Universal code; Order (exchange); Computer science; Arithmetic; Algorithm; Code rate; Linear code; Systematic code; Block code","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.0007198982,0.0007051925,0.0005900079,0.001087941,0.000611965,0.001734194,0.0007698368,0.0009693608,0.003317043],"category_scores_gemma":[0.006077626,0.0002827448,0.0003673176,0.001534255,0.001110675,0.002090949,0.001516828,0.001634,0.0009679413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006011153,"about_ca_system_score_gemma":0.001258513,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005003063,"about_ca_topic_score_gemma":0.000698638,"domain_scores_codex":[0.998833,0.0002899984,0.00007386371,0.0001452357,0.0004645498,0.0001934669],"domain_scores_gemma":[0.9968089,0.001430336,0.0003026327,0.0006820707,0.0006164712,0.0001594942],"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.0003652752,0.00008166936,0.0005785084,0.0001419428,0.00001799396,0.0003563428,0.0003471589,0.03005708,0.01159984,0.8621836,0.004719598,0.08955092],"study_design_scores_gemma":[0.00006742388,0.0001446536,0.0003804812,0.0000669443,0.00002495112,0.0006869677,0.000183138,0.2439357,0.01208879,0.7328475,0.0095214,0.00005213264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2751044,0.001369413,0.692714,0.001316505,0.0003324871,0.0001361304,0.001125007,0.0007658564,0.02713613],"genre_scores_gemma":[0.8268398,0.0009829495,0.1575282,0.0002888037,0.0002634084,0.0002556511,0.001346719,0.0002768886,0.01221771],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003317043,"threshold_uncertainty_score":0.01109654,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01079473506623293,"score_gpt":0.2691636732684782,"score_spread":0.2583689382022453,"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."}}