Baron, DrorBaraniuk, Richard G.2007-10-312007-10-312006-04-012006-06-06D. Baron and R. G. Baraniuk, "Faster Sequential Universal Coding via Block Partitioning," <i>IEEE Transactions on Information Theory,</i> vol. 52, no. 4, 2006.https://hdl.handle.net/1911/19723Journal PaperRissanen 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.engLossless source codingredundancysequential codinguniversal codingDSP for CommunicationsJournal articleLossless source codingredundancysequential codinguniversal codinghttp://dx.doi.org/10.1109/TIT.2006.871041