Slepian-Wolf Coding of Binary Finite Memory Source Using Burrows-Wheeler Transform

Abstract—In this paper, an asymmetric Slepian-Wolf coding (SWC) scheme for binary finite memory source (FMS) is proposed. The a priori information about the source is extracted from the side information at the decoder by Burrows-Wheeler Transform (BWT). Such information is then utilized for the LDPC code based decoding. Benefiting from the universality of BWT, our coding scheme can be applied to any FMS. Experimental results show that our scheme performs significantly better than the scheme which does not utilize the a priori information for decoding.

• Type: Conference
• Year: 2009
• Where: DCC
• Authors: Chao Chen, Xiangyang Ji, Qionghai Dai, Xiaodong Liu
• Keywords: Asymmetric Slepian-wolf Coding, Binary finite Memory, Computer Graphics, DCC 2009, Priori Information