Decoding Linear Codes over Chain Rings Given by Parity Check Matrices

被引：0

作者：

Gomez-Torrecillas, Jose ^{[1
,2
]}

Lobillo, F. J. ^{[1
,3
]}

Navarro, Gabriel ^{[3
,4
]}

机构：

[1] Univ Granada, Dept Algebra, E-18071 Granada, Spain

[2] Univ Granada, IMAG, E-18071 Granada, Spain

[3] Univ Granada, CITIC, E-18071 Granada, Spain

[4] Univ Granada, Dept Comp Sci & Artificial Intelligence, E-18071 Granada, Spain

来源：

MATHEMATICS | 2021年 / 9卷 / 16期

关键词：

chain ring; linear code; decoding; parity check matrix;

D O I：

10.3390/math9161878

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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.

引用

页数：20

共 43 条

[41] A new two-stage decoding scheme with unreliable path search to lower the error-floor for low-density parity-check codes
Yang, Pilwoong
Jun, Bohwan
No, Jong-Seon
Park, Hosung
IET COMMUNICATIONS, 2017, 11 (14) : 2173 - 2180
[42] Improved Iterative Hard- and Soft-Reliability Based Majority-Logic Decoding Algorithms for Non-Binary Low-Density Parity-Check Codes
Xiong, Chenrong
Yan, Zhiyuan
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2014, 62 (20) : 5449 - 5457
[43] Time-invariant and switch-type hybrid iterative decoding of low-density parity-check codesDécodage Itératif des Codes de Parité À Faible Densité par une Méthode Hybride À Invariance Dans Le Temps Ou À Basculement
Pirouz Zarrinkhat
Amir H. Banihashemi
Hua Xiao
Annales Des Télécommunications, 2005, 60 (1-2): : 103 - 131

← 1 2 3 4 5 →