Shortened Hamming Codes Maximizing Double Error Detection
classification
💻 cs.DM
cs.ITmath.IT
keywords
doublehammingshortenedcodecodesconstructedconstructiondetect
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.