Skip to search formSkip to main contentSkip to account menu

Hamming bound

Known as: Hamming's bound, Sphere-packing bound, Perfect code 
In mathematics and computer science, in the field of coding theory, the Hamming bound is a limit on the parameters of an arbitrary block code: it is… 
Wikipedia (opens in a new tab)

Related topics

Related topics

16 relations
Block codeChannel (communications)Code wordCoding theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Quasi-Perfect Codes From Cayley Graphs Over Integer Rings
The problem of searching for perfect codes has attracted great attention since the paper by Golomb and Welch, in which the… 
2012
2012
Application of Perfect Space Time Codes: PEP Bounds and Some Practical Insights
The design of perfect space time codes constructed from cyclic division algebra (CDA) on the quasi-static MIMO channel has… 
2007
2007
A Note on Quantum Hamming Bound
Proving the quantum Hamming bound for degenerate nonbinary stabilizer codes has been an open problem for a decade. In this note… 
Highly Cited
2004
Highly Cited
2004
On the optimum number of hops in linear wireless networks
We consider a wireless communication system with a single source node, a single destination node, and multiple relay nodes placed… 
2004
2004
Several properties of short LDPC codes
In this paper, we present several properties on minimum distance(d/sub min/) and girth(G/sub min/) in Tanner graphs for low… 
2004
2004
On the performance of efficient coding techniques over fading channels
The authors propose an analytical method, based on the sphere-packing bound, which can be used to assess the achievable… 
2003
2003
On performance limits of space-time codes: a sphere-packing bound approach
A sphere-packing bound (SPB) on average word-error probability (WEP) is derived to determine the performance limits of space-time… 
2001
2001
Performance of hybrid ARQ schemes for the fading channel
  • F. Babich
  • ICC . IEEE International Conference on…
  • 2001
  • Corpus ID: 42804082
We define and use a general method for evaluating and comparing the performance of different hybrid ARQ schemes for the fading… 
2000
2000
The complexity of irredundant sets parameterized by size
Highly Cited
1979
Highly Cited
1979
On some properties of the undetected error probability of linear codes (Corresp.)
A recent paper [1] discussed the 2^{-p} bound (where p = n- k ) for the probability of undetected error P(\epsilon) for an (n,k… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)