On Optimal Anticodes over Permutations with the Infinity Norm
Information Theory
2010-07-27 v2 math.IT
Abstract
Motivated by the set-antiset method for codes over permutations under the infinity norm, we study anticodes under this metric. For half of the parameter range we classify all the optimal anticodes, which is equivalent to finding the maximum permanent of certain -matrices. For the rest of the cases we show constraints on the structure of optimal anticodes.
Cite
@article{arxiv.1004.1938,
title = {On Optimal Anticodes over Permutations with the Infinity Norm},
author = {Itzhak Tamo and Moshe Schwartz},
journal= {arXiv preprint arXiv:1004.1938},
year = {2010}
}