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.
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… 
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
The poset structures admitting the extended binary Hamming code to be a perfect code
2003
2003
On Z4-linear Preparata-like and Kerdock-like code
We say that a binary code of length n is additive if it is isomorphic to a subgroup of /spl Zopf//sub 2//sup /spl alpha// /spl… 
2003
2003
On the symmetry group of perfect 1-error correcting binary codes
It is shown that for any rank r with n− log(n+1)+4 ≤ r ≤ n−4 and any length n, where n = 2 − 1 and k ≥ 8, there is a perfect code… 
2002
2002
Binary Extended Perfect Codes of Length 16 by the Generalized Concatenated Construction
We enumerate binary extended nonlinear perfect codes of length 16 obtained by the generalized concatenated construction (GC… 
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… 
1999
1999
Every Binary (2m-2, 22m-2-m, 3) Code Can Be Lengthened to Form a Perfect Code of Length 2m-1
We answer a problem posed by Etzion and Vardy (1998) by showing that a binary code of length N=2(m)-2 with 2(N-m) codewords and… 
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)