A Griesmer bound for linear codes over finite quasi-Frobenius rings
From MaRDI portal
Publication:1811109
DOI10.1016/S0166-218X(02)00450-XzbMath1026.94025MaRDI QIDQ1811109
Shiromoto, Keisuke, Storme, L.
Publication date: 10 June 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Griesmer boundlinear codecodes over ringsquasi-Frobenius ringschain ringsprojective Hjelmslev geometries
Related Items (11)
A novel approach for constructing reversible codes and applications to DNA codes over the ring \(\mathbb{F}_2 [u /(u^{2 k} - 1)\)] ⋮ Codes over \(\mathbb F_{4}+v\mathbb F_4\) and some DNA applications ⋮ Unnamed Item ⋮ Cyclic DNA codes over \(\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2\) and their applications ⋮ Two families of few-weight codes over a finite chain ring ⋮ Notes on linear codes over finite commutative chain rings ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Linear codes over \(\mathbb {F}_{q}[x/(x^2)\) and \(\mathrm{GR}(p^2,m)\) reaching the Griesmer bound] ⋮ DNA computing over the ring ℤ4[v/〈v2 − v〉] ⋮ On linear codes over \(\mathbb Z_2\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a geometrical method of construction of maximal t-linearly independent sets
- A survey of recent works with respect to a characterization of an (n,k,d;q)-code meeting the Griesmer bound using a min\(\cdot hyper\) in a finite projective geometry
- On generalized Hamming weights for Galois ring linear codes
- Arcs, blocking sets, and minihypers
- Linear codes over finite chain rings
- Linear Codes over Finite Chain Rings and Projective Hjelmslev Geometries
- A characterization of codes meeting the Griesmer bound
- Duality for modules over finite rings and applications to coding theory
- Arcs in projective Hjelmslev planes
- Algebraically punctured cyclic codes
- A Bound for Error-Correcting Codes
This page was built for publication: A Griesmer bound for linear codes over finite quasi-Frobenius rings
