On the Size of Optimal Anticodes over Permutations with the Infinity Norm

Itzhak Tamo, Moshe Schwartz

Research output: Working paper/PreprintPreprint

Abstract

Motivated by the set-antiset method for codes over permutations under the infinity norm, we study anticodes under this metric. We derive tight upper bound for the size of the optimal anticode, which is equivalent of finding the maximum permanent of certain 0-1 matrices.
Original languageEnglish
Volumeabs/1004.1938
StatePublished - 2010

Publication series

NameCoRR

Fingerprint

Dive into the research topics of 'On the Size of Optimal Anticodes over Permutations with the Infinity Norm'. Together they form a unique fingerprint.

Cite this