{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078758,0.0004410864,0.000553181,0.0005656384,0.0002387173,0.0005852504,0.0009276054,0.0006263488,0.0009953475],"category_scores_gemma":[0.002867262,0.0002098037,0.0002971451,0.0008987876,0.0007771697,0.001177697,0.001054066,0.0008796892,0.0004086702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005092448,"about_ca_system_score_gemma":0.0005088822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004239809,"about_ca_topic_score_gemma":0.0004734295,"domain_scores_codex":[0.9994059,0.0001459079,0.00002885717,0.0000757228,0.0002940012,0.00004961838],"domain_scores_gemma":[0.9986358,0.0005259034,0.0002065383,0.0003124198,0.0002573915,0.00006185544],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004299755,0.000113628,0.000720736,0.0002154377,0.00007413183,0.000282476,0.0001886822,0.4148359,0.101904,0.3206455,0.001464233,0.1591253],"study_design_scores_gemma":[0.00002935652,0.00007812661,0.0001581054,0.00002258187,0.00001342636,0.0001570548,0.000007905058,0.9450248,0.02517414,0.02742869,0.001878419,0.00002741184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01582293,0.0002028628,0.982293,0.00008611067,0.00002204163,0.0000330006,0.00003627278,0.0002403676,0.001263501],"genre_scores_gemma":[0.5349892,0.0005334869,0.4614446,0.000208186,0.00004767731,0.0001582741,0.0001778904,0.00009563571,0.002344946],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0009953475,"threshold_uncertainty_score":0.004165232,"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."}}