Quasi-cyclic codes - Open Access .click

Discrete Mathematics, Algorithms and Applications, 2022
In this paper, we use a novel approach to describe generator polynomials of quasi-cyclic (QC) and generalized QC (GQC) codes over finite fields. Our study of QC- and GQC-codes will be general and not only restricted to one-generator codes. We prove that generator polynomials of QC-codes and GQC-codes are unique.
Taher Abualrub, Padmapani Seneviratne
openaire +1 more source

On complementary-dual quasi-cyclic codes

Finite Fields and Their Applications, 2009
A linear code with a complementary dual (an LCD code) is a linear code \(C\) whose dual \(C^ \perp\) satisfies \(C\cap C^ \perp= \{0\}\). Necessary and sufficient conditions for a cyclic code be an LCD code were given by \textit{X. Yang} and \textit{J. L. Massey} [Discrete Math. 126, No. 1--3, 391--393 (1994; Zbl 0790.94022)].
M Esmaeili
exaly +2 more sources

On quasi-cyclic codes

Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252), 2002
Many binary quasi-cyclic codes have a better minimum distance than other known linear codes with the same parameters. We present 43 new quasi-cyclic codes, which improve on the parameters of previously found quasi-cyclic codes. Five of them even improve the lower bound on the minimum distance for linear codes.
P. Heijnen, H. van Tilborg, S. Weijs
openaire +1 more source

girth
mathematics
ldpc codes

engineering general
civil engineering general
iterative decoding

cyclic codes
quasi-cyclic