Results 251 to 260 of about 115,969 (299)
Some of the next articles are maybe not open access.
1-Generator Quasi-Cyclic Codes
Journal of Systems Science and Complexity, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pei, Junying, Zhang, Xuejun
openaire +2 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.
Bommier, Grégoire, Blanchet, Francis
openaire +1 more source
Construction of Multi-Rate Quasi-Cyclic LDPC Codes for Satellite Communications
IEEE Transactions on Communications, 2021To provide reliable transmissions with flexible rates for satellite communications, this paper presents a novel method of constructing multi-rate quasi-cyclic low-density parity-check (LDPC) codes. The basic idea is to generate low-rate codes from a high-
Chong Zhang +4 more
semanticscholar +1 more source
Applied Mathematics-A Journal of Chinese Universities, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pei, Junying, Zhang, Xuejun
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pei, Junying, Zhang, Xuejun
openaire +2 more sources
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
Discrete Mathematics
We study quasi-cyclic codes of index 2 over finite fields. We give a classification of such codes. Their duals with respect to the Euclidean, symplectic and Hermitian inner products are investigated. We describe self-orthogonal and dual-containing codes.
K. Abdukhalikov +2 more
semanticscholar +1 more source
We study quasi-cyclic codes of index 2 over finite fields. We give a classification of such codes. Their duals with respect to the Euclidean, symplectic and Hermitian inner products are investigated. We describe self-orthogonal and dual-containing codes.
K. Abdukhalikov +2 more
semanticscholar +1 more source
QUANTUM ERROR-CORRECTING CODES FROM QUASI-CYCLIC CODES
International Journal of Quantum Information, 2008Quasi-cyclic codes form a generalization of cyclic codes, and contain a large number of record breaking codes. In this paper, we provide a method for constructing self-orthogonal quasi-cyclic codes, and obtain a large number of new quantum quasi-cyclic codes by CSS construction.
Qian, Jianfa, Ma, Wenping, Wang, Xinmei
openaire +2 more sources
Optimal ternary quasi-cyclic codes
Designs, Codes and Cryptography, 1992zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Greenough, P. P., Hill, Raymond
openaire +2 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
Quasi-cyclic binary Goppa codes
Proceedings of IEEE International Symposium on Information Theory, 2002We give here a necessary and sufficient condition for a binary Goppa code to be quasi-cyclic, a sufficient condition easier to check, a partial converse and some specific forms for quasi-cyclic Goppa codes.
F. Blanchet, G. Bommier
openaire +1 more source