Infinite families of p-ary distance optimal linear codes for odd prime numbers p
Filomat · 2025 · 39 (20) · 6931-6942
DOI: 10.2298/fil2520931p ↗Kurz gefasst
Fachartikel in der Zeitschrift Filomat, 2025. Verfasst von Yang Pan und 2 weiteren Autor:innen. Die Arbeit nennt 14 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC0).
Abstract (Originalsprache)
In this paper, we consider infinite families of linear codes associated to down sets over the ring R= Fp + uFp for u2 = 0 and p an odd prime number. We determine the Lee weight distributions for these codes when the down sets are generated by a single or two maximal elements. When applying the Gray map to such linear codes, we have identified (p-1)(2p-1) classes of p-ary distance optimal linear codes, and some of which meet the Griesmer bound.
Zitieren
APA
Pan, Y., Ye, C., & Liu, Y. (2025). Infinite families of p-ary distance optimal linear codes for odd prime numbers p. Filomat, 39(20), 6931-6942. https://doi.org/10.2298/fil2520931p
Vancouver
Pan Y, Ye C, Liu Y. Infinite families of p-ary distance optimal linear codes for odd prime numbers p. Filomat. 2025;39(20):6931-6942. doi:10.2298/fil2520931p
BibTeX
@article{Pan2025,
author = {Pan, Yang and Ye, Chang and Liu, Yan},
title = {Infinite families of p-ary distance optimal linear codes for odd prime numbers p},
journal = {Filomat},
year = {2025},
volume = {39},
number = {20},
pages = {6931--6942},
doi = {10.2298/fil2520931p}
}
EUVIMED