{"id":"W4291319443","doi":"10.48550/arxiv.1605.06615","title":"Efficient and Compact Representations of Some Non-Canonical Prefix-Free Codes","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Xunta de Galicia; European Commission; Gruppo Nazionale per il Calcolo Scientifico; Universidade da Coruña; Istituto Nazionale di Alta Matematica \"Francesco Severi\"; Agencia Nacional de Investigación y Desarrollo; Helsingin Yliopisto","keywords":"Prefix code; Code word; Prefix; Lexicographical order; Word (group theory); Code (set theory); Combinatorics; Mathematics; Constant (computer programming); Alphabet; Order (exchange); Decoding methods; Discrete mathematics; Binary logarithm; ENCODE; Sigma; Encoding (memory); Computer science; Algorithm; Linear code; Physics; Block code","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005659757,0.0006954711,0.0005598192,0.001144852,0.0005829711,0.001707905,0.001001943,0.0007611097,0.003336209],"category_scores_gemma":[0.004887757,0.0003355032,0.0004380197,0.002024603,0.0009820636,0.002692408,0.001181048,0.001550743,0.001310129],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008726399,"about_ca_system_score_gemma":0.001561427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001254186,"about_ca_topic_score_gemma":0.001994495,"domain_scores_codex":[0.9986952,0.0002019641,0.0001092279,0.0001841742,0.0006084641,0.0002010162],"domain_scores_gemma":[0.9974635,0.000623916,0.0002458419,0.0008155166,0.0007515893,0.00009962606],"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.0003821417,0.0001224467,0.0006982553,0.0002055299,0.00002719843,0.0003977383,0.0003883779,0.0899126,0.02406591,0.6788635,0.01028174,0.1946545],"study_design_scores_gemma":[0.0000901504,0.0002246343,0.0003379704,0.00007675989,0.00003557781,0.0005743781,0.0001762003,0.4837374,0.0330525,0.4544351,0.02716717,0.00009213752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0879034,0.0008311315,0.8909877,0.0008237385,0.0002350945,0.0001425325,0.001209686,0.001578322,0.01628841],"genre_scores_gemma":[0.4733038,0.001095493,0.508841,0.0004510861,0.0002297554,0.0004977623,0.002616338,0.0005071284,0.01245769],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003336209,"threshold_uncertainty_score":0.01116079,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05301903942482356,"score_gpt":0.215923996379469,"score_spread":0.1629049569546454,"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."}}