Linear codes with few weights over $ \mathbb{F}_{p}+u\mathbb{F}_{p} $
- 1 January 2026
- journal article
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 23, 17-39
Abstract
For any positive integer $ m $ and an odd prime $ p $, let $ \mathbb{F}_{q}+u\mathbb{F}_{q} $, where $ q = p^{m} $, be a ring extension of the ring $ \mathbb{F}_{p}+u\mathbb{F}_{p}. $ In this paper, we construct linear codes over $ \mathbb{F}_{p}+u\mathbb{F}_{p} $ by using the trace function defined from $ \mathbb{F}_{q}+u\mathbb{F}_{q} $ onto $ \mathbb{F}_{p}+u\mathbb{F}_{p} $ and determine their Hamming-weight distributions by employing symplectic-weight distributions of their Gray images.
Keywords
All Related Versions
This publication has 32 references indexed in Scilit:
- Complete weight enumerators of quasi-2-dimensional cyclic codesComputational and Applied Mathematics, 2025
- Complete weight enumerators of few-weight linear codesCryptography and Communications, 2025
- Linear codes from defining sets over ${\mathbb {F}}_{p} +u{\mathbb {F}}_{p}$ and their applicationsComputational and Applied Mathematics, 2023
- A class of linear codes with their complete weight enumerators over finite fieldsCryptography and Communications, 2021
- Several classes of linear codes with a few weights from defining sets over $\mathbb {F}_p+u\mathbb {F}_p$ F p + u F pDesigns, Codes and Cryptography, 2018
- Binary linear codes with two or three weights from niho exponentsCryptography and Communications, 2017
- Hamming weights in irreducible cyclic codesDiscrete Mathematics, 2013
- The weight distribution of some irreducible cyclic codesFinite Fields and Their Applications, 2012
- The linear programming bound for codes over finite Frobenius ringsDesigns, Codes and Cryptography, 2007
- A Construction of Optimal Constant Composition CodesDesigns, Codes and Cryptography, 2006