A Unified Perspective on Parity-And Syndrome-Based Binary Data Compression Using Off-the-Shelf Turbo Codecs

The authors consider the problem of compressing memoryless binary data with or without side information at the decoder. They review the parity- and the syndrome-based approaches and discuss their theoretical limits, assuming that there exists a virtual binary symmetric channel between the source and the side information, and that the source is not necessarily uniformly distributed. They take a factor-graph-based approach in order to devise how to take full advantage of the ready-available iterative decoding procedures when turbo codes are employed, in both a parity- or a syndrome-based fashion.