Faster Sequential Universal Coding via Block Partitioning
dc.citation.bibtexName | article | en_US |
dc.citation.firstpage | 1708 | en_US |
dc.citation.issueNumber | 4 | en_US |
dc.citation.journalTitle | IEEE Transactions on Information Theory | en_US |
dc.citation.lastpage | 1710 | en_US |
dc.citation.volumeNumber | 52 | en_US |
dc.contributor.author | Baron, Dror | en_US |
dc.contributor.author | Baraniuk, Richard G. | en_US |
dc.contributor.org | Digital Signal Processing (http://dsp.rice.edu/) | en_US |
dc.date.accessioned | 2007-10-31T00:36:41Z | en_US |
dc.date.available | 2007-10-31T00:36:41Z | en_US |
dc.date.issued | 2006-04-01 | en_US |
dc.date.modified | 2006-06-06 | en_US |
dc.date.submitted | 2006-06-06 | en_US |
dc.description | Journal Paper | en_US |
dc.description.abstract | Rissanen provided a sequential universal coding algorithm based on a block partitioning scheme, where the source model is estimated at the beginning of each block. This approach asymptotically approaches the entropy at the fastest possible rate of 1/2log(n) bits per unknown parameter. We show that the complexity of this algorithm is /spl Omega/(nlog(n)), which is comparable to existing sequential universal algorithms. We provide a sequential O(nlog(log(n))) algorithm by modifying Rissanen's block partitioning scheme. The redundancy with our approach is greater than with Rissanen's block partitioning scheme by a multiplicative factor 1+O(1/log(log(n))), hence it asymptotically approaches the entropy at the fastest possible rate. | en_US |
dc.identifier.citation | D. Baron and R. G. Baraniuk, "Faster Sequential Universal Coding via Block Partitioning," <i>IEEE Transactions on Information Theory,</i> vol. 52, no. 4, 2006. | en_US |
dc.identifier.doi | http://dx.doi.org/10.1109/TIT.2006.871041 | en_US |
dc.identifier.uri | https://hdl.handle.net/1911/19723 | en_US |
dc.language.iso | eng | en_US |
dc.subject | Lossless source coding | en_US |
dc.subject | redundancy | en_US |
dc.subject | sequential coding | en_US |
dc.subject | universal coding | en_US |
dc.subject.keyword | Lossless source coding | en_US |
dc.subject.keyword | redundancy | en_US |
dc.subject.keyword | sequential coding | en_US |
dc.subject.keyword | universal coding | en_US |
dc.subject.other | DSP for Communications | en_US |
dc.title | Faster Sequential Universal Coding via Block Partitioning | en_US |
dc.type | Journal article | en_US |
dc.type.dcmi | Text | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Bar2006Apr1FasterSequ.PDF
- Size:
- 128.93 KB
- Format:
- Adobe Portable Document Format