{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/80852"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/80852","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Fast Parallel Algorithms for Universal Lossless Source Coding","abstract":"The O(N/B) parallel compression algorithm estimates the MDL source among all tree sources whose maximal depth is log( N/B). This algorithm can be extended to parallel algorithms that support unbounded context depths. This will provide low redundancy performance over a much broader class of sources, and may lead to new applications that until now were limited by the throughput bottleneck of serial compression algorithms.","abstract_html":"The O(N/B) parallel compression algorithm estimates the MDL source among all tree sources whose maximal depth is log( N/B). This algorithm can be extended to parallel algorithms that support unbounded context depths. This will provide low redundancy performance over a much broader class of sources, and may lead to new applications that until now were limited by the throughput bottleneck of serial compression algorithms.","abstract_has_math":false,"creators":["Baron, Dror"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Electrical Engineering","degree_department":null,"school":null,"contributors":["Bresler, Yoram"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:08:30Z","date_published":"2015-09-25T20:08:30Z","updated_at":"2026-07-22T22:26:15Z","subjects":["Engineering, Electronics and Electrical"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3111670"],"render_values":[{"text":"(MiAaPQ)AAI3111670","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/80852","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Bresler, Yoram"]},{"key":"dc:creator","label":"Author","values":["Baron, Dror"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:08:30Z","10000-01-01","2003"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Engineering, Electronics and Electrical"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/80852","(MiAaPQ)AAI3111670"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The O(N/B) parallel compression algorithm estimates the MDL source among all tree sources whose maximal depth is log( N/B). This algorithm can be extended to parallel algorithms that support unbounded context depths. This will provide low redundancy performance over a much broader class of sources, and may lead to new applications that until now were limited by the throughput bottleneck of serial compression algorithms.","Made available in DSpace on 2015-09-25T20:08:30Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3111670.pdf: 10122211 bytes, checksum: 771b30412e76621c42c5eac6e4bf10bb (MD5) Previous issue date: 2003","Embargo set by: Seth Robbins for item 82134 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","217 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2003."]},{"key":"dc:title","label":"Title","values":["Fast Parallel Algorithms for Universal Lossless Source Coding"]}]}],"canonical_facts":{"dc:contributor":["Bresler, Yoram"],"dc:creator":["Baron, Dror"],"dc:date":["2015-09-25T20:08:30Z","10000-01-01","2003"],"dc:description":["The O(N/B) parallel compression algorithm estimates the MDL source among all tree sources whose maximal depth is log( N/B). This algorithm can be extended to parallel algorithms that support unbounded context depths. This will provide low redundancy performance over a much broader class of sources, and may lead to new applications that until now were limited by the throughput bottleneck of serial compression algorithms.","Made available in DSpace on 2015-09-25T20:08:30Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3111670.pdf: 10122211 bytes, checksum: 771b30412e76621c42c5eac6e4bf10bb (MD5) Previous issue date: 2003","Embargo set by: Seth Robbins for item 82134 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","217 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2003."],"dc:identifier":["http://hdl.handle.net/2142/80852","(MiAaPQ)AAI3111670"],"dc:language":["eng"],"dc:subject":["Engineering, Electronics and Electrical"],"dc:title":["Fast Parallel Algorithms for Universal Lossless Source Coding"],"dc:type":["text"],"thesis:degree_discipline":["Electrical Engineering"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:15Z"}