Lattice of ideals of the polynomial ring over a commutative chain ring
From MaRDI portal
Publication:496108
DOI10.1007/s00200-015-0253-8zbMath1329.13049arXiv1308.0727OpenAlexW2083147865MaRDI QIDQ496108
Publication date: 17 September 2015
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.0727
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)
Cites Work
- Codes over \(R_k\), Gray maps and their binary images
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Self-dual codes over commutative Frobenius rings
- Linear codes over \({\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}\)
- A construction of finite Frobenius rings and its application to partial difference sets
- Cocyclic Hadamard matrices from forms over finite Frobenius rings
- Ring geometries, two-weight codes, and strongly regular graphs
- Chain rings and prime ideals
- Rings and constructions of partial difference sets
- Bent functions, partial difference sets, and quasi-Frobenius local rings
- Cyclic codes and minimal strong Gröbner bases over a principal ideal ring.
- Finite chain rings
- New bounds for codes over finite Frobenius rings
- Finite Rings with Applications
- On the Structure of Cyclic and Negacyclic Codes over Finite Chain Rings
- Gröbner Bases over Commutative Rings and Applications to Coding Theory
- Duality for modules over finite rings and applications to coding theory
- Hamming metric decoding of alternant codes over Galois rings
- FINITE QUASI-FROBENIUS MODULES AND LINEAR CODES
- Code equivalence characterizes finite Frobenius rings
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Lattice of ideals of the polynomial ring over a commutative chain ring
