Login / Signup
Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces.
Vladimir I. Levenshtein
Published in:
IEEE Trans. Inf. Theory (1995)
Keyphrases
</>
design space
error detection
upper bound
error correction
lower bound
moment invariants
upper and lower bounds
error correcting
worst case
hamming distance
error correcting codes
lower and upper bounds
error bounds
bag of words
vc dimension
binary codes
distance measure
pattern recognition
genetic algorithm