On the redundancy of trellis lossy source coding
Guangcai Zhou, Zhen Zhang · IEEE Transactions on Information Theory · 2002
It is well known that trellis lossy source codes have better performance/complexity tradeoff than block codes, as shown by simulations. This makes the trellis coding technique attractive in practice. To get a better understanding of this fact, this paper studies the redundancy of trellis coding for memoryless sources and compares it with a similar result for block codes.