Decoding Linear Codes over Chain Rings Given by Parity Check Matrices

José Gómez-Torrecillas, F. J. Lobillo and Gabriel Navarro
Additional contact information
José Gómez-Torrecillas: Department of Algebra and IMAG, University of Granada, E18071 Granada, Spain
F. J. Lobillo: Department of Algebra and CITIC, University of Granada, E18071 Granada, Spain
Gabriel Navarro: Department of Computer Science and Artificial Intelligence and CITIC, University of Granada, E18071 Granada, Spain

Mathematics, 2021, vol. 9, issue 16, 1-20

Abstract: We design a decoding algorithm for linear codes over finite chain rings given by their parity check matrices. It is assumed that decoding algorithms over the residue field are known at each degree of the adic decomposition.

Keywords: chain ring; linear code; decoding; parity check matrix (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/9/16/1878/pdf (application/pdf)
https://www.mdpi.com/2227-7390/9/16/1878/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:9:y:2021:i:16:p:1878-:d:610112

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().