A Griesmer bound for linear codes over finite quasi-Frobenius rings (Q1811109)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Griesmer bound for linear codes over finite quasi-Frobenius rings |
scientific article; zbMATH DE number 1925287
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Griesmer bound for linear codes over finite quasi-Frobenius rings |
scientific article; zbMATH DE number 1925287 |
Statements
A Griesmer bound for linear codes over finite quasi-Frobenius rings (English)
0 references
10 June 2003
0 references
The authors prove a lower bound on the length of a linear code over a finite quasi-Frobenius ring. This bound can be considered an analogue of the well-known Griesmer bound for linear codes over finite fields. The authors provide a geometric characterization of the codes meeting the new bound.
0 references
codes over rings
0 references
quasi-Frobenius rings
0 references
chain rings
0 references
Griesmer bound
0 references
projective Hjelmslev geometries
0 references
linear code
0 references
