{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006956417,0.0004283564,0.0004254074,0.0005563879,0.0002104251,0.0004556628,0.0007619819,0.0006355612,0.001061529],"category_scores_gemma":[0.003152023,0.0002033756,0.0002328078,0.0007774464,0.0005952916,0.001257965,0.0005831114,0.0006479007,0.0003751509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003669551,"about_ca_system_score_gemma":0.0005289365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005990301,"about_ca_topic_score_gemma":0.0007557923,"domain_scores_codex":[0.9996276,0.00009406817,0.00001713323,0.00003026282,0.0002052259,0.00002574717],"domain_scores_gemma":[0.9989433,0.0004834385,0.0001444981,0.0001545754,0.0002352446,0.00003910209],"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.0004237272,0.00005876766,0.0006500463,0.0002318585,0.00005051808,0.0002663844,0.0001082098,0.6679781,0.05956471,0.1448227,0.00117801,0.1246669],"study_design_scores_gemma":[0.00001481305,0.00005742444,0.0001010547,0.00001278572,0.000008979251,0.00009141793,0.000006093049,0.9721437,0.01595289,0.01078866,0.0008050795,0.00001728325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0285916,0.0004524807,0.9690173,0.0001460739,0.00004438633,0.00002913693,0.00003232727,0.0002579874,0.001428705],"genre_scores_gemma":[0.64975,0.0009306878,0.3454676,0.0001997498,0.00006553538,0.00009311952,0.0001377265,0.0001032827,0.003252408],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001061529,"threshold_uncertainty_score":0.003678977,"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."}}