Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
On the structure of non-full-rank perfect codes Denis S. Krotov Sobolev Institute of Mathematics and Mechanics and Mathematics… Expand
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
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… Expand
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
One formidable difficulty in quantum communication and computation is to protect information-carrying quantum states against… Expand
  • table 1
  • table 2
Is this relevant?
2005
2005
An r-perfect code of a graph G = (V, E) is a set C ⊆ V such that the r-balls centered at vertices of C form a partition of V. It… Expand
  • figure 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We consider a wireless communication system with a single source node, a single destination node, and multiple relay nodes placed… Expand
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
An independent set C of vertices in a graph is an efficient dominating set (or perfect code) when each vertex not in C is… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Given a set S of n sites (points), and a distance measure d , the nearestneighborsearching problem is to build a data structure… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Properties of nonlinear perfect binary codes are investigated and several new constructions of perfect codes are derived from… Expand
Is this relevant?
Highly Cited
1979
Highly Cited
1979
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… Expand
Is this relevant?