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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
It is proven that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and… (More)
  • figure 1
Is this relevant?
2010
2010
A famous open problem in the theory of quantum error-correcting codes is whether or not the parameters of an impure quantum code… (More)
Is this relevant?
2009
2009
In this paper, the need for the construction of asymmetric and multiblock space-time codes is discussed. Above the trivial… (More)
  • table I
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Fuzzy vault has been shown to be an effective technique for securing fingerprint minutiae templates. Its security depends on the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2008
Highly Cited
2008
For output-symmetric discrete memoryless channels (DMCs) at even moderately high rates, fixed-block-length communication systems… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
Subsystem codes are a generalization of noiseless subsystems, decoherence-free subspaces and stabilizer codes. We generalize the… (More)
Is this relevant?
2007
2007
Quantum stabilizer codes are a known class of quantum codes that can protect quantum information against noise and decoherence… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
In a recent paper, perfect (n times n) space-time codes were introduced as the class of linear dispersion space-time (ST) codes… (More)
  • figure 1
  • figure 2
  • table I
  • figure 4
  • figure 5
Is this relevant?
2007
2007
It is desirable to study upper and lower bounds on the minimum distance and dimensions of quantum codes, so the computer search… (More)
  • figure 1
Is this relevant?
1994
1994
We prove that the following problems are NP-complete: (1) the existence of a l-perfect code in a planar cubic graph, (2… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?