New bounds for permutation codes in Ulam metric
2015 IEEE International Symposium on Information Theory (ISIT), 2015•ieeexplore.ieee.org
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.
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.
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.
ieeexplore.ieee.org
Showing the best result for this search. See all results