Repeated root cyclic codes over \(\mathbb{Z}_{p^2}+u\mathbb{Z}_{p^2}\) and their Lee distances
From MaRDI portal
Publication:2673770
DOI10.1007/s12095-021-00540-9OpenAlexW3205332281MaRDI QIDQ2673770
Raj Kumar, Maheshanand Bhaintwal
Publication date: 13 June 2022
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-021-00540-9
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)
Uses Software
Cites Work
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Cyclic codes over \(\text{GR}(p^2,m)\) of length \(p^k\)
- Cyclic and negacyclic codes over the Galois ring \(\text{GR}(p^2,m)\)
- Cyclic codes and minimal strong Gröbner bases over a principal ideal ring.
- Cyclic codes over the ring \(\mathbb{Z}_p [u, v / \langle u^2, v^2, u v - v u \rangle\)]
- Cyclic codes over \({\mathbb{F}}_2 + u{\mathbb{F}}_2 + v{\mathbb{F}}_2 + uv{\mathbb{F}}_2\)
- Some results on cyclic codes over ℤq + uℤq
- Some results on cyclic codes over the ring $R_{2,m}$
- On the generators of Z/sub 4/ cyclic codes of length 2/sup e/
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Polynomial weights and code constructions
- On repeated-root cyclic codes
- Repeated-root cyclic codes
This page was built for publication: Repeated root cyclic codes over \(\mathbb{Z}_{p^2}+u\mathbb{Z}_{p^2}\) and their Lee distances
