On the Relationships Among Optimal Symmetric Fix-Free Codes

Symmetric fix-free codes are prefix condition codes in which each codeword is required to be a palindrome. Their study is motivated by the topic of joint source-channel coding and by some information retrieval problems. Although they have been considered by a few communities they are not well understood. In earlier work, we used a collection of instances of Boolean satisfiability problems as a tool in the generation of all optimal binary symmetric fix-free codes with n codewords and observed that the number of different optimal codelength sequences grows slowly compared with the corresponding number for prefix condition codes. We demonstrate that all optimal symmetric fixfree codes can alternatively be obtained by sequences of codes generated by simple manipulations starting from one particular code. We also discuss simplifications in the process of searching for this set of codes as well as a conjecture, which if correct, together with the other results leads to a relatively fast algorithm which has been implemented in MATLAB to construct all optimal binary symmetric fix-free codes.

[1]  Serap A. Savari,et al.  On the Relationships Among Optimal Symmetric Fix-Free Codes , 2014, IEEE Trans. Inf. Theory.

[2]  Douglas Stott Parker,et al.  The Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem Over a Lattice of Binary Trees , 1999, SIAM J. Comput..

[3]  Shmuel Tomi Klein,et al.  Bidirectional Huffman Coding , 1990, Comput. J..

[4]  Detlev Marpe,et al.  The H . 264 / MPEG 4 Advanced Video Coding Standard and its Applications , 2006 .

[5]  Chin-Chen Chang,et al.  Construction of Symmetrical Reversible Variable Length Codes Using Backtracking , 2003, Comput. J..

[6]  D. Marpe,et al.  The H.264/MPEG4 advanced video coding standard and its applications , 2006, IEEE Communications Magazine.

[7]  Ja-Ling Wu,et al.  Modified symmetrical reversible variable-length code and its theoretical bounds , 2001, IEEE Trans. Inf. Theory.

[8]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[9]  Joachim Hagenauer,et al.  On variable length codes for iterative source/channel decoding , 2001, Proceedings DCC 2001. Data Compression Conference.

[10]  Gary J. Sullivan,et al.  Rate-constrained coder control and comparison of video coding standards , 2003, IEEE Trans. Circuits Syst. Video Technol..

[11]  M. Wada,et al.  Reversible variable length codes , 1995, IEEE Trans. Commun..

[12]  John D. Villasenor,et al.  An algorithm for construction of efficient fix-free codes , 2003, IEEE Communications Letters.

[13]  Serap A. Savari,et al.  A SAT-Based Scheme to Determine Optimal Fix-Free Codes , 2010, 2010 Data Compression Conference.

[14]  Ajay Luthra,et al.  Overview of the H.264/AVC video coding standard , 2003, IEEE Trans. Circuits Syst. Video Technol..

[15]  E. F. Moore,et al.  Variable-length binary encodings , 1959 .

[16]  Marcel Paul Schützenberger,et al.  ON an APPIICATICN , 1998 .

[17]  M. Schutzenberger,et al.  On an application of semi groups methods to some problems in coding , 1956 .

[18]  Edgar N. Gilbert,et al.  Codes based on inaccurate source probabilities , 1971, IEEE Trans. Inf. Theory.

[19]  Serap A. Savari.  On Minimum-Redundancy Fix-Free Codes , 2009, 2009 Data Compression Conference.

[20]  N. J. A. Sloane,et al.  The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..

[21]  Serap A. Savari,et al.  On Optimal and Achievable Fix-Free Codes , 2012, IEEE Transactions on Information Theory.

[22]  Yunghsiang Sam Han,et al.  An A*-Based Algorithm for Constructing Reversible Variable Length Codes with Minimum Average Codeword Length , 2010, IEEE Transactions on Communications.

[23]  Ja-Ling Wu,et al.  On constructing the Huffman-code-based reversible variable-length codes , 2001, IEEE Trans. Commun..

[24]  Joachim Hagenauer,et al.  Iterative source/channel-decoding using reversible variable length codes , 2000, Proceedings DCC 2000. Data Compression Conference.

[25]  Holger Schnettler,et al.  On the 3/4-Conjecture for Fix-Free Codes -- A Survey , 2007, ArXiv.

[26]  Umberto Eco,et al.  Theory of Codes , 1976 .

[27]  Serap A. Savari.  On optimal reversible-variable-length codes , 2009, 2009 Information Theory and Applications Workshop.