Matrix-Product Codes over Commutative Rings and Constructions Arising from σ,δ-Codes

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...

Full description

Saved in:
Bibliographic Details
Published in:Journal of mathematics (Hidawi) 2021, Vol.2021, p.1-10
Main Authors: Boulagouaz, Mhammed, Deajim, Abdulaziz
Format: Article
Language:English
Subjects:
Codes
Fields (mathematics)
Linear codes
Lower bounds
Mathematics
Rings (mathematics)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2314-4629
2314-4785
DOI:10.1155/2021/5521067