{"id":"W1740830514","doi":"10.1109/icsmc.2001.972876","title":"Enhanced static Fano coding","year":2002,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Huffman coding; Fano plane; Lossless compression; Computer science; Algorithm; Shannon–Fano coding; Canonical Huffman code; Data compression; Coding (social sciences); Theoretical computer science; Decoding methods; Mathematics; Code rate; Systematic 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.000662022,0.0004332169,0.0004449524,0.001440401,0.0006775532,0.000754286,0.0009387562,0.0004735624,0.002706849],"category_scores_gemma":[0.003156965,0.0001776501,0.0003234174,0.001644333,0.000931201,0.001723976,0.0007254065,0.000497933,0.0006109143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008818695,"about_ca_system_score_gemma":0.0008882835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002308153,"about_ca_topic_score_gemma":0.003526207,"domain_scores_codex":[0.9994587,0.0001081829,0.00002557103,0.00007928446,0.0002555948,0.00007259388],"domain_scores_gemma":[0.9986608,0.0004631655,0.0000907116,0.0003648993,0.0003812482,0.00003917448],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001987622,0.00004315925,0.001205915,0.0001204549,0.00001909838,0.0002786176,0.0002260046,0.08094972,0.02906534,0.3393686,0.006510328,0.5420141],"study_design_scores_gemma":[0.00002661784,0.0001207621,0.0007969589,0.00005275719,0.00003034576,0.0006497349,0.00006707558,0.7813817,0.0456369,0.1260834,0.04509619,0.00005756125],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03119577,0.0004146574,0.9551285,0.0001774927,0.00009997065,0.00008126046,0.0001911425,0.0009519332,0.01175922],"genre_scores_gemma":[0.453343,0.00065013,0.527603,0.000267688,0.0001517963,0.0001908322,0.0007163498,0.0002604477,0.01681667],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002706849,"threshold_uncertainty_score":0.009055316,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02562122692773213,"score_gpt":0.2385757262851579,"score_spread":0.2129544993574258,"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."}}