Cyclic Codes over Galois Rings
From MaRDI portal
Publication:2795950
DOI10.1007/978-3-319-29221-2_20zbMath1434.94099OpenAlexW2399717790MaRDI QIDQ2795950
Jasbir Kaur, Sucheta Dutt, Ranjeet Sehmi
Publication date: 23 March 2016
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-29221-2_20
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Cyclic codes (94B15)
Related Items (4)
Reversible complement cyclic codes over Galois rings with application to DNA codes ⋮ On rank and MDR cyclic and negacyclic codes of length \(p^k\) over \(\mathbb Z_{p^m}\) ⋮ On Rank and MDR Cyclic Codes of Length $$2^k$$ 2 k Over $$Z_8$$ Z 8 ⋮ Cyclic codes over the ring \(\mathrm{GR}(p^e, m) [u / \langle u^k \rangle \)]
Cites Work
- Unnamed Item
- Unnamed Item
- On modular cyclic codes
- 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 over the integers modulo \(p^m\).
- Transform domain characterization of cyclic codes over \(\mathbb{Z}_ m\)
- Cyclic codes of length \(2^e\) over \(\mathbb Z_4\).
- Cyclic codes and minimal strong Gröbner bases over a principal ideal ring.
- Modular and \(p\)-adic cyclic codes
- Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes
- Repeated-root cyclic and negacyclic codes over a finite chain ring
- Cyclic codes over \(\mathbb Z_4\) of even length
- Strong Gröbner bases for polynomials over a principal ideal ring
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- IDEALS OF Zpn[X/(Xl-1)]
- Gröbner bases over Galois rings with an application to decoding alternant codes
This page was built for publication: Cyclic Codes over Galois Rings
