Hamming code

Known as: Single-error correction, double-error detection, Hamming coding, SEC-DED 
In telecommunication, Hamming codes are a family of linear error-correcting codes that generalize the Hamming(7,4)-code, and were invented by Richard… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Due to the high speed of internet and advances in technology, people are becoming more worried about information being hacked by… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
2010
2010
In this paper, we propose a concatenated Reed-Solomon code with a Hamming code for dynamic random access memory (DRAM) controller… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 6
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Starting from Shannon's celebrated 1948 channel coding theorem, we trace the evolution of channel coding from Hamming codes to… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
Hamming code is well known for its single-bit error detection & correction capability. To provide such a capability, it… (More)
Is this relevant?
2004
2004
Design and test results for a fully integrated translinear tail-biting MAP error-control decoder are presented. Decoder designs… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2002
Highly Cited
2002
This work compares two fault tolerance techniques, Hamming code and Triple Modular Redundancy (TMR), that are largely used to… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
In this paper we investigate a generalization of Gallager's (1963) low-density (LD) parity-check codes, where as component codes… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1995
Highly Cited
1995
This paper presents some basic theorems giving the structure of cyclic codes of length n over the ring of integers modulo pa and… (More)
  • table 1
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Certain notorious nonlinear binary codes contain more codewords than any known linear code. These include the codes constructed… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1986
Highly Cited
1986
A~.~hslruct-Lexicographic codes, or lexicodes, are defined by various versions of the greedy algorithm. The theory of these codes… (More)
  • table I
  • table IV
  • table V
  • table VI
  • table VII
Is this relevant?