Shortened Hamming Codes Maximizing Double Error Detection

Details Shortened Hamming Codes Maximizing Double Error Detection Shortened Hamming Codes Maximizing Double Error Detection

2010-11-08

arxiv.org/abs/1011.1933v2

Computer Science

Discrete Mathematics

We withdraw the paper since we found a reference from 1981 that solves exactly the same problem

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Shortened Hamming Codes Maximizing Double Error Detection does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Shortened Hamming Codes Maximizing Double Error Detection, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Shortened Hamming Codes Maximizing Double Error Detection will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-492152