{"id":"W2151087881","doi":"10.1109/vtcf.2006.366","title":"Random Binning and Turbo Source Coding for Lossless Compression of Memoryless Sources","year":2006,"lang":"en","type":"article","venue":"IEEE Vehicular Technology Conference","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"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":"Computer science; Turbo code; Lossless compression; Variable-length code; Algorithm; Theoretical computer science; Context-adaptive binary arithmetic coding; Entropy encoding; Data compression; Source code; Distributed source coding; Tunstall coding; Decoding methods","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.0002804757,0.0002161806,0.0004247701,0.0003149812,0.0002648282,0.0001053674,0.0009854996,0.0002637575,0.000002558709],"category_scores_gemma":[0.0000411852,0.0001835818,0.00006222096,0.0003498871,0.0003441445,0.0003386666,0.0004134093,0.0002158671,0.000001812582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001318656,"about_ca_system_score_gemma":0.0000488179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007564258,"about_ca_topic_score_gemma":0.000007033994,"domain_scores_codex":[0.998477,0.0000493823,0.0003691007,0.0005504967,0.0002177255,0.0003362522],"domain_scores_gemma":[0.9986609,0.0001825618,0.0002761446,0.0006141459,0.000217935,0.00004832377],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001307361,0.0002925335,0.007115686,0.0003470551,0.00008700063,0.00004742535,0.0004871395,0.003462595,0.6610628,0.1016975,0.0008355813,0.2244339],"study_design_scores_gemma":[0.002927047,0.0001356312,0.0005703135,0.00044048,0.00002980784,0.00005963368,0.0001318611,0.4805728,0.4965861,0.01489929,0.003229165,0.000417816],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3880187,0.0005472755,0.6105721,0.0002851704,0.0001242885,0.000214227,0.00000700348,0.000195066,0.0000362028],"genre_scores_gemma":[0.960669,0.00003620238,0.03910104,0.00002799006,0.00004338687,0.00004165483,0.000008364254,0.00001258847,0.00005971032],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5726504,"threshold_uncertainty_score":0.7486248,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01209993563538342,"score_gpt":0.2300457274370346,"score_spread":0.2179457918016512,"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."}}