Results 241 to 250 of about 56,593 (280)
Some of the next articles are maybe not open access.
An Explicit Construction of Quantum Stabilizer Codes From Quasi-Cyclic Codes
IEEE Communications Letters, 2020In this short letter, our main objective is to construct good quantum stabilizer codes over small fields, which have a more potential possibility to be employed in actual quantum processors.
Jingjie Lv, Ruihu Li, Junli Wang
semanticscholar +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
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.
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
IEEE Transactions on Information Theory
In this paper, we construct many infinite families of distance-optimal codes with new parameters, some of which are BCH codes and quasi-cyclic codes. In particular, we report the first infinite family of binary distance-optimal BCH codes with the minimum
Conghui Xie, Hao Chen, Chen Yuan
semanticscholar +1 more source
In this paper, we construct many infinite families of distance-optimal codes with new parameters, some of which are BCH codes and quasi-cyclic codes. In particular, we report the first infinite family of binary distance-optimal BCH codes with the minimum
Conghui Xie, Hao Chen, Chen Yuan
semanticscholar +1 more source
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
Skew quasi cyclic codes over 𝔽q + v𝔽q
Journal of Algebra and its Applications, 2019In this work, skew quasi cyclic codes over [Formula: see text], where [Formula: see text] are considered. The generating set for one generator skew quasi cyclic codes over [Formula: see text] is also determined.
M. Özen, N. T. Özzaim, H. Ince
semanticscholar +1 more source
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
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
2014
In this chapter, we recall the main definitions concerning quasi-cyclic codes, which will be used in the remainder of the book. We introduce the class of circulant matrices, and the special class of circulant permutation matrices, together with their isomorphism with polynomials over finite fields.
openaire +1 more source
In this chapter, we recall the main definitions concerning quasi-cyclic codes, which will be used in the remainder of the book. We introduce the class of circulant matrices, and the special class of circulant permutation matrices, together with their isomorphism with polynomials over finite fields.
openaire +1 more source