New Bounds for Permutation Codes in Ulam Metric
Information Theory
2015-04-21 v1 Combinatorics
math.IT
Abstract
New bounds on the cardinality of permutation codes equipped with the Ulam distance are presented. First, an integer-programming upper bound is derived, which improves on the Singleton-type upper bound in the literature for some lengths. Second, several probabilistic lower bounds are developed, which improve on the known lower bounds for large minimum distances. The results of a computer search for permutation codes are also presented.
Cite
@article{arxiv.1504.05100,
title = {New Bounds for Permutation Codes in Ulam Metric},
author = {Faruk Göloğlu and Jüri Lember and Ago-Erik Riet and Vitaly Skachek},
journal= {arXiv preprint arXiv:1504.05100},
year = {2015}
}
Comments
To be presented at ISIT 2015, 5 pages