Results 21 to 30 of about 848,601 (293)
On the Girth of Tanner (3, 13) Quasi-Cyclic LDPC Codes
IEEE Access, 2019 Girth is an important structural property of low-density parity-check (LDPC) codes. Motivated by the works on the girth of Tanner (3, 5), (3, 7), (3, 11), and (5, 7) quasi-cyclic (QC) LDPC codes, we, in this paper, study the girth of Tanner (3, 13) QC ...
Hengzhou Xu +4 more
doaj +1 more source
On the Construction of Skew Quasi-Cyclic Codes [PDF]
IEEE Transactions on Information Theory, 2010 In this paper we study a special type of quasi-cyclic (QC) codes called skew QC codes. This set of codes is constructed using a non-commutative ring called the skew polynomial rings $F[x;θ]$. After a brief description of the skew polynomial ring $F[x;θ]$ it is shown that skew QC codes are left submodules of the ring $R_{s}^{l}=(F[x;θ]/(x^{s}-1))^{l ...
Taher Abualrub +3 more
openaire +3 more sources
Construction of regular quasi-cyclic protograph LDPC codes based on Vandermonde matrices [PDF]
, 2008 In this contribution, we investigate the attainable performance of quasi-cyclic (QC) protograph Low-Density Parity-Check (LDPC) codes for transmission over both Additive White Gaussian Noise (AWGN) and uncorrelated Rayleigh channels.
Sheng Chen +5 more
core +1 more source
Tanner
IEEE Access, 2019 Girth plays an important role in the design of low-density parity-check (LDPC) codes. Motivated by the works on the girth of some classes of Tanner quasi-cyclic (QC) LDPC codes, e.g., Tanner (3, 5), (3, 7), (3, 11), and (5, 7) codes, we, in this paper ...
Hengzhou Xu +4 more
doaj +1 more source
Quasi-cyclic Generalized LDPC codes with low error floors [PDF]
, 2008 In this paper, a novel methodology for designing structured generalized LDPC (G-LDPC) codes is presented. The proposed design results in quasi-cyclic G-LDPC codes for which efficient encoding is feasible through shift-register-based circuits.
Ryan, William E. +6 more
core +1 more source
On quasi-cyclic subspace codes
CoRR, 2016 Construction of subspace codes with good parameters is one of the most important problems in random network coding. In this paper we present first a generalization of the concept of cyclic subspaces codes and further we show that the usual methods for constructing cyclic subspace codes over finite fields works for m-quasi cyclic codes, namely the ...
Ismael Gutiérrez, Ivan Molina
openaire +2 more sources
Discrete Applied Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anne Desideri Bracco +2 more
openaire +2 more sources
Quasi-Cyclic Codes Via Unfolded Cyclic Codes and Their Reversibility
IEEE Access, 2019 The finite field $\mathbb {F}_{q^\ell }$ of $q^\ell $ elements contains $\mathbb {F}_{q}$ as a subfield. If $\theta \in \mathbb {F}_{q^\ell }$ is of degree $\ell $ over $\mathbb {F}_{q}$ , it can be used to unfold elements of $\mathbb {F}_{q^\
Ramy Taki Eldin, Hajime Matsui
doaj +1 more source
Use of Blind Rivets in Sandwich Panels—Experimental Investigation of Static and Quasi-Cyclic Loading
Buildings, 2020 In this paper, we present an original experimental investigation on a pull-out test of a blind rivet from the external facing of sandwich panels with various core layer materials (polyisocyanurate foam, mineral wool, and expanded polystyrene).
Robert Studziński +1 more
doaj +1 more source
Finite Fields and Their Applications, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hongxi Tong, Ding Yang
openaire +2 more sources