Results 261 to 270 of about 115,969 (299)
Some of the next articles are maybe not open access.
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 ...
Townsend, Richard L. +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
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
Efficient Encoding of Quasi-Cyclic Low-Density Parity-Check Codes
IEEE Advanced Information Technology, Electronic and Automation Control Conference, 2018A compact encoding process with three phases is proposed for quasi-cyclic low-density parity-check (QC-LDPC) codes. A back substitution circuit is shared at the first and third phases.
Tingting Liang +3 more
semanticscholar +1 more source
On Spectral Design Methods for Quasi-Cyclic Codes
IEEE Transactions on Information Theory, 2019A method is provided for constructing upper triangular square matrices over the univariate polynomial ring over a finite field, under certain constraints on the eigenvalues of the matrices. In some cases of interest, the degree of the determinant of such
R. Roth, Alexander Zeh
semanticscholar +1 more source
IEEE transactions on broadcasting, 2018
With the worldwide deployment and rapid development of digital television terrestrial broadcasting (DTTB) systems, the demands of diversified multimedia services from the fixed/mobile receptions increase significantly. To satisfy the various requirements
Yushu Zhang +3 more
semanticscholar +1 more source
With the worldwide deployment and rapid development of digital television terrestrial broadcasting (DTTB) systems, the demands of diversified multimedia services from the fixed/mobile receptions increase significantly. To satisfy the various requirements
Yushu Zhang +3 more
semanticscholar +1 more source
Journal of Applied Mathematics and Computation, 2023
Md Ajaharul Hossain, R. Bandi
semanticscholar +1 more source
Md Ajaharul Hossain, R. Bandi
semanticscholar +1 more source
Short quasi-cyclic LDPC codes from convolutional codes
2009 IEEE International Symposium on Information Theory, 2009We search for good regular quasi-cyclic (QC) LDPC codes with J = 2 ones in each column. In order to simplify the search, QC LDPC codes are represented in the form of tail-biting (TB) convolutional codes. A modified BEAST algorithm is used for finding the free distance (minimum distance) and the girth of both parent convolutional and block LDPC codes ...
Irina E. Bocharova +3 more
openaire +1 more source
New codes from chains of quasi-cyclic codes
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., 2005Well 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.
M. Grassl, G. White
openaire +1 more source
On the locality of quasi-cyclic codes over finite fields
Designs, Codes and Cryptography, 2022Charul Rajput, Maheshanand Bhaintwal
semanticscholar +1 more source

