Optimal permutation anticodes with the infinity norm via permanents of (0,1)-matrices

Authors:
Moshe Schwartz;Itzhak Tamo
Affiliations:
Department of Electrical and Computer Engineering, Ben-Gurion University of the Negev, Israel;Department of Electrical and Computer Engineering, Ben-Gurion University of the Negev, Israel
Venue:
Journal of Combinatorial Theory Series A
Year:
2011

Citing 13
Cited 0

The Erdo¨s-Ko-Rado theorem for vector spaces

Journal of Combinatorial Theory Series A
Anticodes for the Grassman and bilinear forms graphs

Designs, Codes and Cryptography
Regular Article: The Diametric Theorem in Hamming Spaces驴Optimal Anticodes

Advances in Applied Mathematics
On Perfect Codes and Related Concepts

Designs, Codes and Cryptography
Codes and anticodes in the Grassman graph

Journal of Combinatorial Theory Series A
Constructions for Permutation Codes in Powerline Communications

Designs, Codes and Cryptography
Optimal tristance anticodes in certain graphs

Journal of Combinatorial Theory Series A
Correcting charge-constrained errors in the rank-modulation scheme

IEEE Transactions on Information Theory
Correcting limited-magnitude errors in the rank-modulation scheme

IEEE Transactions on Information Theory
Permutation arrays under the Chebyshev distance

IEEE Transactions on Information Theory
Codes in permutations and error correction for rank modulation

IEEE Transactions on Information Theory
Rank permutation group codes based on Kendall's correlation statistic

IEEE Transactions on Information Theory
Two constructions of permutation arrays

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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.