A combinatorial construction of the Gray map over Galois rings (Q1025970): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2008.09.002 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2048771505 / rank | |||
Normal rank |
Revision as of 19:50, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A combinatorial construction of the Gray map over Galois rings |
scientific article |
Statements
A combinatorial construction of the Gray map over Galois rings (English)
0 references
23 June 2009
0 references
A Gray map is defined to be a weight preserving map from \(\mathbb{R}^n\) with the homogeneous weight to \(F^m\) with the Hamming weight where \(R\) is a ring and \(F\) is a field. Gray maps are an extremely important object of study in coding theory and are one of the reasons why codes over rings have become increasingly studied. The author gives an interesting new combinatorial construction of Gray maps when \(R\) is a Galois ring using affine hyperplanes in an associated affine geometry.
0 references
linear codes
0 references
Galois rings
0 references
homogeneous weights
0 references
Gray maps
0 references
affine geometries
0 references
affine hyperplanes
0 references