On optimal anticodes over permutations with the infinity norm

Itzhak Tamo, Moshe Schwartz

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 languageEnglish
Title of host publication2011 Information Theory and Applications Workshop, ITA 2011 - Conference Proceedings
Pages367
Number of pages1
DOIs
StatePublished - 2011
Externally publishedYes
Event2011 Information Theory and Applications Workshop, ITA 2011 - San Diego, CA, United States
Duration: 6 Feb 201111 Feb 2011

Publication series

Name2011 Information Theory and Applications Workshop, ITA 2011 - Conference Proceedings

Conference

Conference2011 Information Theory and Applications Workshop, ITA 2011
Country/TerritoryUnited States
CitySan Diego, CA
Period6/02/1111/02/11

Fingerprint

Dive into the research topics of 'On optimal anticodes over permutations with the infinity norm'. Together they form a unique fingerprint.

Cite this