Results 251 to 260 of about 56,593 (280)
Some of the next articles are maybe not open access.

On the Girth of Quasi-Cyclic Protograph LDPC Codes

IEEE Transactions on Information Theory, 2012
In this paper, we study the relationships between the girth of the Tanner graph of a quasi cyclic (QC) protograph low-density parity-check (LDPC) code, on one hand, and the lifting degree and the size and the structure of the base graph, on the other hand.
Mehdi Karimi, Amir H. Banihashemi
openaire   +1 more source

Projective spaces and quasi-cyclic codes

Ars Comb., 1998
The incidence matrix of a finite projective plane of order \(q\) can be arranged as a circulant matrix with ones on the diagonal. By appending a unit matrix one obtains a generating matrix for a binary code that is studied in the paper. It is a double circulant \([2(q^2 + q +1), q^2+ q + 1, q+2]\)-code, and, if \(q\) is odd, by omitting the odd-weight ...
T. Aaron Gulliver, Vijay K. Bhargava
openaire   +1 more source

New codes from chains of quasi-cyclic codes

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., 2005
Well known constructions are applied to chains of quasi-cyclic codes in order to achieve new codes that improve on best known bounds on the minimum distance. These techniques have previously been successfully applied to chains of cyclic and algebraic-geometric codes.
Markus Grassl, Greg White 0001
openaire   +1 more source

Weight distributions of generalized quasi-cyclic codes over Fq+uFq

Finite Fields Their Appl., 2023
Jian Gao, Xiangrui Meng, Fang-Wei Fu
semanticscholar   +1 more source

On the locality of quasi-cyclic codes over finite fields

Designs, Codes and Cryptography, 2022
Charul Rajput, Maheshanand Bhaintwal
semanticscholar   +1 more source

A link between quasi-cyclic codes and convolutional codes

IEEE Transactions on Information Theory, 1998
Summary: Given a quasi-cyclic code with minimum Hamming distance \(d\), a set of convolutional codes is derived with free distance equal to \(d\). It is shown that an increase in the rate of these codes results in a decrease in the memory length. The connection between these codes is illustrated with several well-known quasi-cyclic codes.
Morteza Esmaeili   +3 more
openaire   +2 more sources

The structure of generalized quasi cyclic codes

2005
The structure of generalized quasi-cyclic (GQC) codes is investigated. These are codes in which a permutation automorphism has orbits of varying lengths on the coordinate positions. A BCH-type bound is derived which is similar to that for quasi-cyclic (QC) codes.
ŞİAP, İrfan, Kulhan, Nilgün
openaire   +2 more sources

On generalizations of skew quasi-cyclic codes

2020
Summary: In the last two decades, codes over noncommutative rings have been one of the main trends in coding theory. Due to the fact that noncommutativity brings many challenging problems in its nature, still there are many open problems to be addressed.
BEDİR, Sümeyra   +2 more
openaire   +2 more sources

Quasi-cyclic codes: algebraic properties and applications

Computational and Applied Mathematics, 2020
Mohamadbagher Zeraatpisheh   +3 more
semanticscholar   +1 more source

Quantum Codes Derived from One-Generator Quasi-Cyclic Codes with Hermitian Inner Product

International Journal of Theoretical Physics, 2019
Jingjie Lv, Ruihu Li, Junli Wang
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy