On Multidimensional 2-Weight-Limited Burst-Correcting Codes
By: Hagai Berend, Ohad Elishco, Moshe Schwartz
Potential Business Impact:
Fixes computer errors with two mistakes.
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_\infty$ distance between the positions is bounded, the $L_1$ 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.
Similar Papers
From One-Dimensional Codes to Two-Dimensional Codes: A Universal Framework for the Bounded-Weight Constraint
Information Theory
Makes computer storage hold more data reliably.
Linear Binary Codes Correcting One or More Errors
Information Theory
Fixes mistakes in computer messages.
New Bounds for Linear Codes with Applications
Information Theory
Finds better ways to send messages without errors.