Shortened Hamming Codes Maximizing Double Error Detection

Computer Science – Discrete Mathematics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-492152

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.