Binary error correcting codes achieve higher data protection limits
Four New Single-Error-Correcting Binary Codes
Information Theory
Summary
Finding ways to protect data from mistakes during transmission or storage is important, and error-correcting codes help with this by detecting and fixing errors. This paper presents four new codes that improve the known limits on how many error-free messages can be sent using certain binary codes that fix single errors. The new codes were discovered by the authors using computer-based search methods. These advances help understand the capabilities of error-correcting codes in securing digital information.
What this means in practice
- •For data storage engineers: Improve reliability of storage devices by using codes with enhanced error correction to reduce data corruption from single-bit errors.
- •For digital communication engineers: Design communication systems that transmit more information reliably by employing codes that correct single-bit errors with better message capacity.
Authors
Moshe Milshtein
Abstract
We construct a $(16, 3072, 3)$-code, a $(17,6144,3)$-code, an $(18,12288,3)$-code and a $(19,24576,3)$-code. Consequently, we get four new lower bounds: $A(16,3) \geq 3072$, $A(17,3) \geq 6144$, $A(18,3) \geq 12288$ and $A(19,3) \geq~24576$. Each of the codes consists of a union of cosets of a linear code. The constructions are the result of a computer search executing a tabu search algorithm.