Year: 2010
Type: preprint
Abstract: Given $r\geq 3$ and $2^{r-1}+1\leq n< 2^{r}-1$, an $[n,n-r,3]$ shortened Hamming code that can detect a maximal number of double errors is constructed. The optimality of the construction is proven.
Source: arXiv (Cornell University)
Authors: Blaum, Mario, Sanyal, Sugata
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1941424644