Abstract
Let p be any prime number such that p≡1(mod4), and let Fp be the finite field of p elements. In this paper, we first construct a new AMDS symbol-pair cyclic code of length 4p and of symbol-pair distance 9 by examining its generator polynomial. We then use the generator polynomial to obtain a family of (p-1)/2 AMDS symbol-pair constacyclic codes of the same length and of the same symbol-pair distance.
| Original language | English |
|---|---|
| Pages (from-to) | 2333-2347 |
| Number of pages | 15 |
| Journal | Designs, Codes, and Cryptography |
| Volume | 93 |
| Issue number | 7 |
| Early online date | 27 Feb 2025 |
| DOIs | |
| Publication status | Published - 31 Jul 2025 |
Bibliographical note
Publisher Copyright:© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.
Acknowledgements
This research is funded by University of Economics and Law, Vietnam National University Ho Chi Minh City/VNU-HCM. We thank the anonymous reviewers for their careful reading of our manuscript and their valuable comments and suggestions.Keywords
- Almost maximum distance separable (AMDS) symbol-pair code
- Cyclic code
- Symbol-pair distance
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science Applications
- Discrete Mathematics and Combinatorics
- Applied Mathematics