Decremental Redundancy Compression with Fountain Codes

This paper proposes a new noise-robust lossless compression algorithm, for binary memoryless sources, based on a decremental redundancy approach with Fountain codes. Both the whole binary entropy range compression performance and the noise-robustness of an existing incremental redundancy Fountain code compression technique are exceeded. An input source is coded with a new modified incremental degree LT-code (Luby transform) and a decremental redundancy algorithm is used to compress the Fountain-coded source. The performance variations with a systematic precode, a constant input degree distribution and a low-complexity puncturing distribution are investigated as possible amendments to the LT-code bipartite graph, for the case of decremental redundancy. The improved compression and robustness against transmission errors with our novel incremental degree puncturing decremental redundancy algorithm over that of the existing incremental redundancy closed-loop iterative doping (LT-CLID) algorithm is shown.