Constructions and bounds for codes with restricted overlaps
Document Type
Article
Publication Date
8-14-2023
Department
Department of Mathematical Sciences
Abstract
Non-overlapping codes have been studied for almost 60 years. In such a code, no proper, non-empty prefix of any codeword is a suffix of any codeword. In this paper, we study codes in which over-laps of certain specified sizes are forbidden. We prove some general bounds and we give several constructions in the case of binary codes. Our techniques also allow us to provide an alternative, elementary proof of a lower bound on non-overlapping codes due to Levenshtein [9] in 1964.
Publication Title
IEEE Transactions on Information Theory
Recommended Citation
Blackburn, S.,
Esfahani, N.,
Kreher, D. L.,
&
Stinson, D.
(2023).
Constructions and bounds for codes with restricted overlaps.
IEEE Transactions on Information Theory.
http://doi.org/10.1109/TIT.2023.3304712
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p2/66