On optimal anticodes over permutations with the infinity norm

Itzhak Tamo; Moshe Schwartz

doi:10.1109/ITA.2011.5743605

On optimal anticodes over permutations with the infinity norm

Itzhak Tamo, Moshe Schwartz

Department of Electrical & Computer Engineering

Ben-Gurion University of the Negev

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	2011 Information Theory and Applications Workshop, ITA 2011 - Conference Proceedings
Pages	367
Number of pages	1
DOIs	https://doi.org/10.1109/ITA.2011.5743605
State	Published - 13 May 2011
Event	2011 Information Theory and Applications Workshop, ITA 2011 - San Diego, CA, United States Duration: 6 Feb 2011 → 11 Feb 2011

Publication series

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

Conference

Conference	2011 Information Theory and Applications Workshop, ITA 2011
Country/Territory	United States
City	San Diego, CA
Period	6/02/11 → 11/02/11

All Science Journal Classification (ASJC) codes

Computational Theory and Mathematics
Computer Science Applications
Information Systems

Access to Document

10.1109/ITA.2011.5743605

Cite this

@inproceedings{dc5a2c7c876748debe54383803cbbfbe,

title = "On optimal anticodes over permutations with the infinity norm",

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.",

author = "Itzhak Tamo and Moshe Schwartz",

year = "2011",

month = may,

day = "13",

doi = "10.1109/ITA.2011.5743605",

language = "الإنجليزيّة",

isbn = "9781457703614",

series = "2011 Information Theory and Applications Workshop, ITA 2011 - Conference Proceedings",

pages = "367",

booktitle = "2011 Information Theory and Applications Workshop, ITA 2011 - Conference Proceedings",

note = "2011 Information Theory and Applications Workshop, ITA 2011 ; Conference date: 06-02-2011 Through 11-02-2011",

}

Tamo, I & Schwartz, M 2011, On optimal anticodes over permutations with the infinity norm. in 2011 Information Theory and Applications Workshop, ITA 2011 - Conference Proceedings., 5743605, 2011 Information Theory and Applications Workshop, ITA 2011 - Conference Proceedings, pp. 367, 2011 Information Theory and Applications Workshop, ITA 2011, San Diego, CA, United States, 6/02/11. https://doi.org/10.1109/ITA.2011.5743605

On optimal anticodes over permutations with the infinity norm. / Tamo, Itzhak ; Schwartz, Moshe.
2011 Information Theory and Applications Workshop, ITA 2011 - Conference Proceedings. 2011. p. 367 5743605 (2011 Information Theory and Applications Workshop, ITA 2011 - Conference Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On optimal anticodes over permutations with the infinity norm

AU - Tamo, Itzhak

AU - Schwartz, Moshe

PY - 2011/5/13

Y1 - 2011/5/13

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=79955768549&partnerID=8YFLogxK

U2 - 10.1109/ITA.2011.5743605

DO - 10.1109/ITA.2011.5743605

M3 - منشور من مؤتمر

SN - 9781457703614

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

SP - 367

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

T2 - 2011 Information Theory and Applications Workshop, ITA 2011

Y2 - 6 February 2011 through 11 February 2011

ER -

On optimal anticodes over permutations with the infinity norm

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this