On codes over product of finite chain rings.

Saved in:
Bibliographic Details
Title: On codes over product of finite chain rings.
Authors: BAJALAN, Maryam1, REZAEI, Rashid1 ras_rezaei@yahoo.com, SAMEI, Karim2
Source: Sigma: Journal of Engineering & Natural Sciences / Mühendislik ve Fen Bilimleri Dergisi. Feb2023, Vol. 41 Issue 1, p145-155. 11p.
Subjects: Finite rings, Product coding, Parity-check matrix, Finite fields
Abstract: In this paper, codes over the direct product of two finite commutative chain rings are studied. The standard form of the parity-check matrix is determined. The structure of self-dual codes is described. A distance preserving Gray map from the direct product of chain rings to a finite field is defined. Two upper bounds on minimum distance are obtained. [ABSTRACT FROM AUTHOR]
Copyright of Sigma: Journal of Engineering & Natural Sciences / Mühendislik ve Fen Bilimleri Dergisi is the property of Sigma: Journal of Engineering & Natural Sciences / Mühendislik ve Fen Bilimleri Dergisi and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:In this paper, codes over the direct product of two finite commutative chain rings are studied. The standard form of the parity-check matrix is determined. The structure of self-dual codes is described. A distance preserving Gray map from the direct product of chain rings to a finite field is defined. Two upper bounds on minimum distance are obtained. [ABSTRACT FROM AUTHOR]
ISSN:13047191
DOI:10.14744/sigma.2023.00014