Skip to content
DraconiticResearch
Search Sources API
182,549 studies31 sourcesUpdated 46 min ago
PreprintarXiv licencearXiv

Frobenius Profiles of Polynomial-Multiple MRD Codes

  • Yangcheng Li
  • Pingzhi Yuan
Open at sourcePDFDOICite

Abstract

We study Frobenius intersection profiles of maximum rank distance (MRD) codes arising from ordinary polynomial multiples over finite fields. We prove that every numerically admissible profile is realized within this family over every sufficiently large extension, using a root-exponent pattern independent of the extension degree. A factor-orbit gap formula provides the underlying structural description, while effective extension-degree bounds guarantee realization. We also establish a lower bound valid for all polynomial generators and show that the upper and lower bounds differ by only Oq(log n) along an infinite family of parameters. Finally, we characterize the generalized Gabidulin members and obtain non-generalized-Gabidulin realizations of every profile with initial loss at least two over infinitely many extensions.

Related

  1. Binary Codes Correcting Multiple Edits via Polynomial Hashing and Entropy Recycling
    Quan D. Bui, Shuche Wang, Van Khu Vu
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  2. On the structure of polynomial ideal codes and additive Reed--Solomon codes
    Umberto Martínez-Peñas, Rubén Rodríguez-Ballesteros
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  3. Quantum LDPC Codes from Polynomial Minors
    Vahid Nourozi, Roxana Smarandache, David G. M. Mitchell
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryQuantum physics & quantum informationarXiv
  4. Polynomial-Time Constructions of Asymptotically Good Random Access Codes from Linear Codes
    Ruho Kondo, Yota Maeda
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  5. Lifted-Product QLDPC Codes in the Polynomial Domain
    Vahid Nourozi, Mohsen Moradi, Roxana Smarandache +1
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{li2026frobenius,
  title = {{Frobenius Profiles of Polynomial-Multiple MRD Codes}},
  author = {Yangcheng Li and Pingzhi Yuan},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.25722},
  eprint = {2610.25722},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.25722},
}
RIS
TY  - UNPB
TI  - Frobenius Profiles of Polynomial-Multiple MRD Codes
AU  - Yangcheng Li
AU  - Pingzhi Yuan
PY  - 2026
DA  - 2026/10/19
PB  - arXiv
DO  - 10.48550/arxiv.2610.25722
UR  - https://arxiv.org/abs/2610.25722
AB  - We study Frobenius intersection profiles of maximum rank distance (MRD) codes arising from ordinary polynomial multiples over finite fields. We prove that every numerically admissible profile is realized within this family over every sufficiently large extension, using a root-exponent pattern independent of the extension degree. A factor-orbit gap formula provides the underlying structural description, while effective extension-degree bounds guarantee realization. We also establish a lower bound valid for all polynomial generators and show that the upper and lower bounds differ by only O_q(log n) along an infinite family of parameters. Finally, we characterize the generalized Gabidulin members and obtain non-generalized-Gabidulin realizations of every profile with initial loss at least two over infinitely many extensions.
ER  -