On Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes.
Tero LaihonenSimon LitsynPublished in: Des. Codes Cryptogr. (1998)
Keyphrases
- non binary
- upper bound
- decoding algorithm
- minimum distance
- lower bound
- constraint satisfaction problems
- maximum distance
- upper and lower bounds
- constant factor
- lower and upper bounds
- worst case
- binary representation
- arc consistency
- distance measure
- tight upper and lower bounds
- constraint satisfaction
- np complete
- frequent pattern mining
- bayesian networks
- graphical models
- probability distribution
- np hard
- efficiently computable