On the Relationships Among Optimal Symmetric Fix-Free Codes
From MaRDI portal
Publication:2986207
DOI10.1109/TIT.2014.2330839zbMATH Open1360.94384arXiv1211.2723MaRDI QIDQ2986207FDOQ2986207
Authors: S. M. Hossein Tabatabaei Yazdi, S. A. Savari 
Publication date: 16 May 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: 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. 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 fix-free 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.
Full work available at URL: https://arxiv.org/abs/1211.2723
This page was built for publication: On the Relationships Among Optimal Symmetric Fix-Free Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986207)
