On non-expandable cross-bifix-free codes
Chunyan Qin, Bocong Chen, Gaojun Luo

TL;DR
This paper investigates the conditions under which certain cross-bifix-free codes are non-expandable, improves existing results on their maximality, and introduces a new family of codes to expand and optimize their size.
Contribution
The paper proves the exact conditions for non-expandability of $S_{I,J}^{(k)}(n)$ codes, and constructs a new family of codes to expand these codes while maintaining their cross-bifix-free property.
Findings
$S_{I,J}^{(k)}(n)$ is non-expandable iff $k=n-1$ or $1 extless k<n/2$
A new family $U^{(t)}_{I,J}(n)$ is constructed to expand $S_{I,J}^{(k)}(n)$
Explicit formula for the size of the expanded code is provided
Abstract
A cross-bifix-free code of length over is defined as a non-empty subset of satisfying that the prefix set of each codeword is disjoint from the suffix set of every codeword. Cross-bifix-free codes have found important applications in digital communication systems. One of the main research problems on cross-bifix-free codes is to construct cross-bifix-free codes as large as possible in size. Recently, Wang and Wang introduced a family of cross-bifix-free codes , which is a generalization of the classical cross-bifix-free codes studied early by Lvenshtein, Gilbert and Chee {\it et al.}. It is known that is nearly optimal in size and is non-expandable if or . In this paper, we first show that is non-expandable if and only if or , thereby…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Coding theory and cryptography · DNA and Biological Computing
