A lower bound on permutation codes of distance n-1.
Sergey BeregPeter J. DukesPublished in: Des. Codes Cryptogr. (2020)
Keyphrases
- lower bound
- upper bound
- minimum distance
- branch and bound algorithm
- distance measure
- euclidean distance
- optimal solution
- np hard
- quadratic assignment problem
- distance function
- branch and bound
- sufficiently accurate
- neural network
- error correcting codes
- objective function
- lower and upper bounds
- worst case
- error correction
- distance metric
- triangle inequality
- knn