Results 221 to 230 of about 4,571 (255)
Some of the next articles are maybe not open access.
Quasi-cyclic and generalized quasi-cyclic codes and uniqueness of their generators
Discrete Mathematics, Algorithms and Applications, 2022In 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
1-Generator Quasi-Cyclic Codes
Journal of Systems Science and Complexity, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Junying Pei, Xuejun Zhang
exaly +3 more sources
Binary Quasi-Cyclic Goppa Codes
Designs, Codes and Cryptography, 2000A class of quasi-cycic Goppa codes containing irreducibles codes, and partially split ones, is defined. A necessary and sufficient condition for a Goppa code to be quasi-cyclic is given. One more sufficient condition is derived on the defining polynomial of the Goppa code.
Grégoire Bommier, Francis Blanchet
openaire +1 more source
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
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
On the additive cyclic structure of quasi-cyclic codes [PDF]
Discrete Mathematics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cem Güneri +2 more
exaly +5 more sources
IEEE Communications Letters, 2018
Low-density parity-check (LDPC) codes based on affine permutation matrices, APM-LDPC codes, have been attracted recently, because of some advantages rather than QC-LDPC codes in minimum-distance, cycle distribution and error-rate performance. In this letter, circulant and anti-circulant permutation matrices are used to define a class of LDPC codes ...
Zahra Gholami, Mohammad Gholami
openaire +1 more source
Low-density parity-check (LDPC) codes based on affine permutation matrices, APM-LDPC codes, have been attracted recently, because of some advantages rather than QC-LDPC codes in minimum-distance, cycle distribution and error-rate performance. In this letter, circulant and anti-circulant permutation matrices are used to define a class of LDPC codes ...
Zahra Gholami, Mohammad Gholami
openaire +1 more source
One-generator quasi-cyclic codes and their dual codes
Discrete Mathematics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kanat Abdukhalikov +2 more
openaire +2 more sources
Optimal ternary quasi-cyclic codes
Designs, Codes and Cryptography, 1992zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Phil P. Greenough, Ray Hill
openaire +2 more sources
A SPECIAL CLASS OF QUASI-CYCLIC CODES
Bulletin of the Australian Mathematical Society, 2017We study a special class of quasi-cyclic codes, obtained from a cyclic code over an extension field of the alphabet field by taking its image on a basis. When the basis is equal to its dual, the dual code admits the same construction. We give some examples of self-dual codes and LCD codes obtained in this way.
Shi, Minjia +4 more
openaire +1 more source
Self-orthogonal quasi-cyclic codes
IEEE Transactions on Information Theory, 1967A new class of linear block codes, called self-orthogonal quasi-cyclic codes, is defined. It is shown that the problem of designing these codes is equivalent to the problem of designing disjoint difference sets. As a result, several classes of optimal and near-optimal codes can be constructed analytically and other codes can be found by a computer ...
Richard L. Townsend +1 more
openaire +2 more sources