Results 51 to 60 of about 1,960 (155)
On the girth of Tanner (3,7) quasi-cyclic LDPC codes [PDF]
Transactions on Combinatorics, 2012 S. Kim, et al, have been analyzed the girth of some algebraically structured quasi-cyclic (QC) low-density parity-check (LDPC) codes, i.e. Tanner (3,5) of length 5p, where p is a prime of the form 15m+1. In this paper, by extension this method to Tanner (
Mohammad Gholami +1 more
doaj
Efficient One-Time Signatures from Quasi-Cyclic Codes: A Full Treatment
Cryptography, 2018 The design of a practical code-based signature scheme is an open problem in post-quantum cryptography. This paper is the full version of a work appeared at SIN’18 as a short paper, which introduced a simple and efficient one-time secure signature ...
Edoardo Persichetti
doaj +1 more source
Structure and performance of generalized quasi-cyclic codes
Finite Fields and Their Applications, 2017 Generalized quasi-cyclic (GQC) codes form a natural generalization of quasi-cyclic (QC) codes. They are viewed here as mixed alphabet codes over a family of ring alphabets. Decomposing these rings into local rings by the Chinese Remainder Theorem yields a decomposition of GQC codes into a sum of concatenated codes.
Güneri, Cem +5 more
openaire +5 more sources
Optimal GQPC Codes over the Finite Field Fq
MathematicsThis paper presents the algebraic structure of generalized quasi-polycyclic (GQPC) codes, which is a generalization of the right quasi-polycyclic (QPC) and generalized quasi-cyclic (GQC) codes over a finite field Fq.
Kundan Suxena +3 more
doaj +1 more source
Quasi-cyclic codes with cyclic constituent codes
Finite Fields and Their Applications, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Skew Cyclic Codes Over ℤ4 +
IEEE AccessThis paper investigates the algebraic structure and properties of skew cyclic codes over the finite chain ring $R = \mathbb {Z}_{4} + u\mathbb {Z}_{4}$ , where $u^{2} = 0$ .
Eda Tekin
doaj +1 more source
Improved Spectral Bound for Quasi-Cyclic Codes
IEEE Transactions on Information TheorySpectral bounds form a powerful tool to estimate the minimum distances of quasi-cyclic codes. They generalize the defining set bounds of cyclic codes to those of quasi-cyclic codes. Based on the eigenvalues of quasi-cyclic codes and the corresponding eigenspaces, we provide an improved spectral bound for quasi-cyclic codes.
Gaojun Luo +3 more
openaire +3 more sources
An Efficient Construction Method for Quasi-Cyclic Low Density Parity Check Codes
IEEE Access, 2017 In this paper, we propose an optimized belief propagation (OBP) based progressive edge-growth (PEG) method for constructing quasi-cyclic low density parity check (QC-LDPC) codes. In this proposed method, Tanner graphs are built by progressively appending
Yiming Lei, Mingke Dong
doaj +1 more source
QC-LDPC Codes Construction by Concatenating of Circulant Matrices as Block-Columns
International Journal of Information and Communication Technology Research, 2016 In this paper a new low complexity method for constructing binary quasi-cyclic low-density parity-check (QC-LDPC) codes is introduced. In the proposed method, each block-column of the parity check matrix H is made by a circulant matrix in a way that the ...
Mohammad Hesam Tadayon +1 more
doaj
Discrete Dynamics in Nature and Society, 2015 This paper presents four different integer sequences to construct quasi-cyclic low-density parity-check (QC-LDPC) codes with mathematical theory. The paper introduces the procedure of the coding principle and coding.
Yan Zhang, Feng-fan Yang, Weijun Song
doaj +1 more source