Skew constacyclic codes over Galois rings

Delphine Boucher; Patrick Solé; Felix Ulmer

doi:10.3934/amc.2008.2.273

Article Contents

2008, Volume 2, Issue 3: 273-292. Doi: 10.3934/amc.2008.2.273

This issue Previous Article Characterization results on weighted minihypers and on linear codes meeting the Griesmer bound Next Article Groups from cyclic infrastructures and Pohlig-Hellman in certain infrastructures

Skew constacyclic codes over Galois rings

1.
IRMAR (UMR 6625), Université de Rennes 1, Campus de Beaulieu, F-35042 Rennes
2.
I3S, 2000 route des Lucioles, F-06903 Sophia Antipolis

Received: January 2008

Revised: July 2008

Published: August 2008

Abstract Related Papers Cited by

Abstract

We generalize the construction of linear codes via skew polynomial rings by using Galois rings instead of finite fields as coefficients. The resulting non commutative rings are no longer left and right Euclidean. Codes that are principal ideals in quotient rings of skew polynomial rings by a two sided ideals are studied. As an application, skew constacyclic self-dual codes over $GR(4, 2)$ are constructed. Euclidean self-dual codes give self-dual $\mathbb Z_4$−codes. Hermitian self-dual codes yield 3−modular lattices and quasi-cyclic self-dual $\mathbb Z_4$−codes.

Keywords:

Mathematics Subject Classification: 94B60, 12H10.

Citation:

Article Metrics

HTML views() PDF downloads(284) Cited by(0)

Skew constacyclic codes over Galois rings

Abstract

Access History

Article Metrics

Access History

Other Articles By Authors

Catalog

Skew constacyclic codes over Galois rings

Abstract

Access History

SHARE

Article Metrics

Access History

Other Articles By Authors

Catalog

Export File

Citation

Format

Content