Matrix-Product Codes over Commutative Rings and Constructions Arising fromσ,δ-Codes
Open Access
- 3 March 2021
- journal article
- research article
- Published by Wiley in Journal of Mathematics
- Vol. 2021, 1-10
Abstract
A well-known lower bound (over finite fields and some special finite commutative rings) on the Hamming distance of a matrix-product code (MPC) is shown to remain valid over any commutative ring R . A sufficient condition is given, as well, for such a bound to be sharp. It is also shown that an MPC is free when its input codes are all free, in which case a generator matrix is given. If R is finite, a sufficient condition is provided for the dual of an MPC to be an MPC, a generator matrix for such a dual is given, and characterizations of LCD, self-dual, and self-orthogonal MPCs are presented. Finally, the results of this paper are used along with previous results of the authors to construct novel MPCs arising from σ , δ -codes. Some properties of such constructions are also studied.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Algebraic Coding Theory Over Finite Commutative Rings2017
- Matrix-product structure of repeated-root cyclic codes over finite fieldsFinite Fields and Their Applications, 2016
- New quantum codes from evaluation and matrix-product codesFinite Fields and Their Applications, 2015
- Homogeneous weights of matrix product codes over finite principal ideal ringsFinite Fields and Their Applications, 2014
- Matrix product codes over finite commutative Frobenius ringsDesigns, Codes and Cryptography, 2012
- Construction and decoding of matrix-product codes from nested codesApplicable Algebra in Engineering, Communication and Computing, 2009
- Matrix-product codes over finite chain ringsApplicable Algebra in Engineering, Communication and Computing, 2008
- Matrix-Product Codes over ? qApplicable Algebra in Engineering, Communication and Computing, 2001
- Duality for modules over finite rings and applications to coding theoryAmerican Journal of Mathematics, 1999
- Linear codes with complementary dualsDiscrete Mathematics, 1992