# Hamming bound

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2010

2010

- IEEE Transactions on Information Theory
- 2010

It is proven that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) andâ€¦Â (More)

Is this relevant?

2010

2010

- IEEE Transactions on Information Theory
- 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

- IEEE Transactions on Information Theory
- 2009

In this paper, the need for the construction of asymmetric and multiblock space-time codes is discussed. Above the trivialâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- 19th International Conference on Patternâ€¦
- 2008

Fuzzy vault has been shown to be an effective technique for securing fingerprint minutiae templates. Its security depends on theâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- IEEE Transactions on Information Theory
- 2008

For output-symmetric discrete memoryless channels (DMCs) at even moderately high rates, fixed-block-length communication systemsâ€¦Â (More)

Is this relevant?

2008

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

- ArXiv
- 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

- IEEE Transactions on Information Theory
- 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)

Is this relevant?

2007

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)

Is this relevant?

1994

1994

- Discrete Mathematics
- 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)

Is this relevant?