English

Optimal Anticodes, Diameter Perfect Codes, Chains and Weights

Information Theory 2021-01-19 v3 math.IT

Abstract

Let PP be a partial order on [n]={1,2,,n}[n] = \{1,2,\ldots,n\}, Fqn\mathbb{F}_{q}^n be the linear space of nn-tuples over a finite field Fq\mathbb{F}_{q} and ww be a weight on Fq\mathbb{F}_{q}. In this paper, we consider metrics on Fqn\mathbb{F}_{q}^n induced by chain orders PP over [n][n] and weights ww over Fq\mathbb{F}_q, and we determine the cardinality of all optimal anticodes and completely classify them. Moreover, we determine all diameter perfect codes for a set of relevant instances on the aforementioned metric spaces.

Keywords

Cite

@article{arxiv.2005.13715,
  title  = {Optimal Anticodes, Diameter Perfect Codes, Chains and Weights},
  author = {Luciano Panek and Nayene Michele Paião Panek},
  journal= {arXiv preprint arXiv:2005.13715},
  year   = {2021}
}

Comments

This work has been accepted for publication in the IEEE Transactions on Information Theory. Copyright (c) 2021 IEEE. Personal use of this material is permitted. However, permission to use this material for any other purposes must be obtained from the IEEE by sending a request to pubs-permissions@ieee.org

R2 v1 2026-06-23T15:52:12.847Z