On Linear Codes over Local Rings of Order p4
Open Access
- 30 September 2024
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 12 (19) , 3069
Abstract
Suppose R is a local ring with invariants and that is R of order Then, has maximal ideal of order and a residue field F of order where is the coefficient subring of In this article, the goal is to improve the understanding of linear codes over small-order non-chain rings. In particular, we produce the MacWilliams formulas and generator matrices for linear codes of length N over In order to accomplish that, we first list all such rings up to isomorphism for different values of Furthermore, we fully describe the lattice of ideals in R and their orders. Next, for linear codes C over R, we compute the generator matrices and MacWilliams identities, as shown by numerical examples. Given that non-chain rings are not principal ideals rings, it is crucial to acknowledge the difficulties that arise while studying linear codes over them.
Keywords
Funding Information
- King Saud University, Riyadh, Saudi Arabia (RSPD2024R871)
This publication has 15 references indexed in Scilit:
- Complete classification of repeated-root -constacyclic codes of prime power length overDiscrete Mathematics, 2021
- Repeated-root constacyclic codes of length 2ps over $\mathbb {F}_{p^{m}}+u\mathbb {F}_{p^{m}}+u^{2}\mathbb {F}_{p^{m}}$Cryptography and Communications, 2020
- On codes over Frobenius rings: generating characters, MacWilliams identities and generator matricesApplicable Algebra in Engineering, Communication and Computing, 2019
- Constacyclic codes over finite local Frobenius non-chain rings with nilpotency index 3Finite Fields and Their Applications, 2017
- Linear codes over: MacWilliams identities, projections, and formally self-dual codesFinite Fields and Their Applications, 2014
- A class of optimal p-ary codes from one-weight codes over
F
p
[
u
]
/
〈
u
m
〉
Journal of the Franklin Institute, 2013
- Cyclic and Negacyclic Codes Over Finite Chain RingsIEEE Transactions on Information Theory, 2004
- Characterization of finite Frobenius ringsArchiv der Mathematik, 2001
- On the Structure of Linear and Cyclic Codes over a Finite Chain RingApplicable Algebra in Engineering, Communication and Computing, 2000
- Cyclic codes over finite ringsDiscrete Mathematics, 1997