On repeated-root multivariable codes over a finite chain ring

Authors:
E. Martínez-Moro;I. F. Rúa
Affiliations:
Departamento de Matemática Aplicada, Universidad de Valladolid, Soria, Spain 42003;Departamento de Matemáticas, Universidad de Oviedo, Oviedo, Spain 33007
Venue:
Designs, Codes and Cryptography
Year:
2007

Citing 6
Cited 1

Finite Commutative Rings and Their Applications

Finite Commutative Rings and Their Applications
Formal Duality of Linearly Presentable Codes over a Galois Field

AAECC-12 Proceedings of the 12th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Repeated-root cyclic and negacyclic codes over a finite chain ring

Discrete Applied Mathematics - Special issue: Coding and cryptography
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)

Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
Multivariable Codes Over Finite Chain Rings: Serial Codes

SIAM Journal on Discrete Mathematics
Cyclic and negacyclic codes over finite chain rings

IEEE Transactions on Information Theory

Additive semisimple multivariable codes over F4

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we consider repeated-root multivariable codes over a finite chain ring. We show conditions for these codes to be principally generated. We consider a suitable set of generators of the code and compute its minimum distance. As an application we study the relevant example of the generalized Kerdock code in its r-dimensional cyclic version.