{"id":"W2097679877","doi":"10.1109/isit.2006.262008","title":"Lossless Source Coding using Tree Structured Random Binning","year":2006,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Entropy encoding; Lossless compression; Variable-length code; Decoding methods; Tunstall coding; Computer science; Algorithm; Data compression; Context-adaptive binary arithmetic coding; Entropy (arrow of time); Random variable; Random binary tree; Theoretical computer science; Tree (set theory); Arithmetic coding; Source code; Binary tree; Mathematics; Statistics","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0001204884,0.0001429075,0.0001853853,0.0001272393,0.00009643467,0.0000761677,0.0002604904,0.00008881825,0.00006124086],"category_scores_gemma":[0.000009282487,0.0001472085,0.00005357777,0.0001986526,0.00003550748,0.0001475924,0.00006152142,0.0001726699,0.000005725411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007756276,"about_ca_system_score_gemma":0.000006743458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001922814,"about_ca_topic_score_gemma":0.0001023891,"domain_scores_codex":[0.9992706,0.00003039068,0.0002516916,0.0001125055,0.0001307946,0.0002040244],"domain_scores_gemma":[0.9994474,0.00007065916,0.00003472449,0.0003820252,0.00003383897,0.00003133924],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003159594,0.00004729741,0.004287052,0.0001551811,0.00008580781,0.000008613123,0.0008821137,0.2481945,0.6917053,0.02119564,0.004757737,0.02864921],"study_design_scores_gemma":[0.001034082,0.000005659987,0.000841864,0.00007166283,0.00001861418,0.000018356,0.0001151104,0.736755,0.2520129,0.001407626,0.007300068,0.0004191193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4743023,0.0002900656,0.5089869,0.00002732,0.00006252823,0.0001297641,0.000001886101,0.001889301,0.01430989],"genre_scores_gemma":[0.9674523,0.00001837885,0.03227678,0.00002188259,0.00007161442,0.000007005187,0.00001007338,0.00004474373,0.00009719114],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.49315,"threshold_uncertainty_score":0.6002988,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01336428388225074,"score_gpt":0.2320894833714586,"score_spread":0.2187251994892078,"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."}}