DeepAI AI Chat
Log In Sign Up

Constructions and bounds for codes with restricted overlaps

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.


page 1

page 2

page 3

page 4


In search of maximum non-overlapping codes

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

New bounds and constructions for constant weighted X-codes

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

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

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

New Constructions of Optimal Binary LCD Codes

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

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

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

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

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

Codes for Constrained Periodicity

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