Shortened Hamming Codes Maximizing Double Error Detection
Discrete Mathematics
2011-05-24 v2 Information Theory
math.IT
Abstract
Given and , an shortened Hamming code that can detect a maximal number of double errors is constructed. The optimality of the construction is proven.
Keywords
Cite
@article{arxiv.1011.1933,
title = {Shortened Hamming Codes Maximizing Double Error Detection},
author = {Mario Blaum and Sugata Sanyal},
journal= {arXiv preprint arXiv:1011.1933},
year = {2011}
}
Comments
We withdraw the paper since we found a reference from 1981 that solves exactly the same problem