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 (0,1)-matrices. For the rest of the cases we show constraints on the structure of optimal anticodes.
Original language | English |
---|---|
Pages (from-to) | 1761-1774 |
Number of pages | 14 |
Journal | Journal of Combinatorial Theory. Series A |
Volume | 118 |
Issue number | 6 |
DOIs | |
State | Published - 1 Aug 2011 |
Keywords
- Infinity norm
- Optimal anticode
- Permanent
- Permutations
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics