{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/69230"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/69230","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Some Techniques in Universal Source Coding and Coding for Composite Sources","abstract":"We consider three problems in source coding. First, we consider the composite source model. A composite source has a switch driven by a random process which selects one of a possible set of subsources. We derive some convergence results for estimation of the switching process, and use these to prove that the entropy of some composite sources may be computed. Some coding techniques for composite sources are also presented and their performance is bounded.","abstract_html":"We consider three problems in source coding. First, we consider the composite source model. A composite source has a switch driven by a random process which selects one of a possible set of subsources. We derive some convergence results for estimation of the switching process, and use these to prove that the entropy of some composite sources may be computed. Some coding techniques for composite sources are also presented and their performance is bounded.","abstract_has_math":false,"creators":["Wallace, Mark Stanley"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Electrical Engineering","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-12-15T19:04:17Z","date_published":"2014-12-15T19:04:17Z","updated_at":"2026-07-22T22:26:00Z","subjects":["Engineering, Electronics and Electrical"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI8209641"],"render_values":[{"text":"(UMI)AAI8209641","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/69230","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Wallace, Mark Stanley"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-12-15T19:04:17Z","10000-01-01","1982"]},{"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":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/69230","(UMI)AAI8209641"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["We consider three problems in source coding. First, we consider the composite source model. A composite source has a switch driven by a random process which selects one of a possible set of subsources. We derive some convergence results for estimation of the switching process, and use these to prove that the entropy of some composite sources may be computed. Some coding techniques for composite sources are also presented and their performance is bounded.","Next, we construct a variable-length-to-fixed-length (VL-FL) universal code for a class of unifilar Markov sources. A VL-FL code maps strings of source outputs into fixed-length codewords. We show that the redundancy of the code converges to zero uniformly over the class of sources as the blocklength increases. The code is also universal with respect to the initial state of the source. We compare the performance of this code to FL-VL universal codes.","We then consider universal coding for real-valued sources. We show that given some coding technique for a known source, we may construct a code for an class of sources. We show that this technique works for some classes of memoryless sources, and also for a compact subset of the class of k-th order Gaussian autoregressive sources.","Made available in DSpace on 2014-12-15T19:04:17Z (GMT). No. of bitstreams: 1 8209641.pdf: 2925705 bytes, checksum: aedf13dfb82434d220385920f4b13d40 (MD5) Previous issue date: 1982","Embargo set by: Seth Robbins for item 69396 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","120 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1982."]},{"key":"dc:title","label":"Title","values":["Some Techniques in Universal Source Coding and Coding for Composite Sources"]}]}],"canonical_facts":{"dc:creator":["Wallace, Mark Stanley"],"dc:date":["2014-12-15T19:04:17Z","10000-01-01","1982"],"dc:description":["We consider three problems in source coding. First, we consider the composite source model. A composite source has a switch driven by a random process which selects one of a possible set of subsources. We derive some convergence results for estimation of the switching process, and use these to prove that the entropy of some composite sources may be computed. Some coding techniques for composite sources are also presented and their performance is bounded.","Next, we construct a variable-length-to-fixed-length (VL-FL) universal code for a class of unifilar Markov sources. A VL-FL code maps strings of source outputs into fixed-length codewords. We show that the redundancy of the code converges to zero uniformly over the class of sources as the blocklength increases. The code is also universal with respect to the initial state of the source. We compare the performance of this code to FL-VL universal codes.","We then consider universal coding for real-valued sources. We show that given some coding technique for a known source, we may construct a code for an class of sources. We show that this technique works for some classes of memoryless sources, and also for a compact subset of the class of k-th order Gaussian autoregressive sources.","Made available in DSpace on 2014-12-15T19:04:17Z (GMT). No. of bitstreams: 1 8209641.pdf: 2925705 bytes, checksum: aedf13dfb82434d220385920f4b13d40 (MD5) Previous issue date: 1982","Embargo set by: Seth Robbins for item 69396 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","120 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1982."],"dc:identifier":["http://hdl.handle.net/2142/69230","(UMI)AAI8209641"],"dc:subject":["Engineering, Electronics and Electrical"],"dc:title":["Some Techniques in Universal Source Coding and Coding for Composite Sources"],"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:00Z"}