2025/10/29 by Berend, Hagai, Elishco, Ohad, Schwartz, Moshe
#Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT)
paper · doi:10.48550/arxiv.2510.25592
We consider multidimensional codes capable of correcting a burst error of weight at most 2. When two positions are in error, the burst limits their relative position. We study three such limitations: the L_∞ distance between the positions is bounded, the L1 distance between the positions is bounded, or the two positions are on an axis-parallel line with bounded distance between them. In all cases we provide explicit code constructions, and compare their excess redundancy to a lower bound we prove.