DeepAI AI Chat

Constructions and bounds for codes with restricted overlaps

11/18/2022

∙

by Simon R. Blackburn, et al.

∙

∙

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 overlaps 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 in 1964.

Simon R. Blackburn
3 publications
Navid Nasr Esfahani
4 publications
Donald L. Kreher
1 publication
Douglas R. Stinson
8 publications

page 1

page 2

page 3

page 4

∙ 07/24/2023

In search of maximum non-overlapping codes

Non-overlapping codes are block codes that have arisen in diverse contex...

0 Lidija Stanovnik, et al. ∙

∙ 03/15/2019

New bounds and constructions for constant weighted X-codes

As a crucial technique for integrated circuits (IC) test response compac...

0 Xiangliang Kong, et al. ∙

∙ 08/16/2021

Q-ary non-overlapping codes: a generating function approach

Non-overlapping codes are a set of codewords in ⋃_n ≥ 2ℤ_q^n, where ℤ_q ...

0 Geyang Wang, et al. ∙

∙ 02/02/2023

New Constructions of Optimal Binary LCD Codes

Linear complementary dual (LCD) codes can provide an optimum linear codi...

0 Guodong Wang, et al. ∙

∙ 09/05/2018

Bounds on the Error Probability of Raptor Codes under Maximum Likelihood Decoding

In this paper upper bounds on the probability of decoding failure under ...

0 Francisco Lázaro, et al. ∙

∙ 07/06/2023

Theoretical Bounds for the Size of Elementary Trapping Sets by Graphic Methods

Elementary trapping sets (ETSs) are the main culprits for the performanc...

0 Haoran Xiong, et al. ∙

∙ 05/08/2022

Codes for Constrained Periodicity

Reliability is an inherent challenge for the emerging nonvolatile techno...

0 Adir Kobovich, et al. ∙