2023/09/16 by Chun‐Yan Qin, Qin, Chunyan, Bocong Chen +3
Biochemistry, Genetics and Molecular Biology · Computer Science · #94B25 #Algorithms and Data Compression #Coding theory and cryptography #DNA and Biological Computing #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.2309.08915
openalex publication_date 2023/09/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A cross-bifix-free code of length n over ℤq is defined as a non-empty subset of ℤqn 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 SI,J(k)(n), 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 SI,J(k)(n) is nearly optimal in size and SI,J(k)(n) is non-expandable if k=n-1 or 1≤ k