Papers
Topics
Authors
Recent
Search
2000 character limit reached

Shortened Hamming Codes Maximizing Double Error Detection

Published 8 Nov 2010 in cs.DM, cs.IT, and math.IT | (1011.1933v2)

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.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (2)

  1. Mario Blaum 
  2. Sugata Sanyal 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up