Results 41 to 50 of about 1,960 (155)
Design of LDPC Codes: A Survey and New Results
Journal of Communications Software and Systems, 2006 This survey paper provides fundamentals in the design of LDPC codes. To provide a target for the code designer, we first summarize the EXIT chart technique for determining(near-)optimal degree distributions for LDPC code ensembles.
Gianluigi Liva +5 more
doaj
Quasi-cyclic extension based on PEG algorithm for construction of LDPC codes
Tongxin xuebao, 2008 Several important relations between the cycle structure on the Tanner graph and the parity-check matrix H of LDPC codes were proved.A new algorithm for constructing LDPC codes was proposed that introduced quasi-cyclic ex-tension method to PEG algorithm ...
LEI Jing1 +2 more
doaj +2 more sources
Protograph Based Low-Density Parity-Check Codes Design With Mixed Integer Linear Programming
IEEE Access, 2019 An approach to design protograph-based low-density parity-check (LDPC) codes utilizing mixed integer linear programming (MILP) optimization is presented in this paper.
Wojciech Sulek
doaj +1 more source
Low-density parity-check codes based on sparse binary sequences
Tongxin xuebao, 2005 A novel and simple construction of regular LDPC codes was proposed, which used sparse binary sequences, through studying construction methods of LDPC codes.
HE Shan-bao +3 more
doaj +2 more sources
A construction of the high-rate regular quasi-cyclic LDPC codes
EURASIP Journal on Wireless Communications and Networking, 2019 In this paper, a scheme to construct the high-rate regular quasi-cyclic low-density parity-check (QC-LDPC) codes is developed based on the finite geometry low-density parity-check (LDPC) codes.
Qi Meng +3 more
doaj +1 more source
On quasi-cyclic subspace codes
, 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 ...
Garcia, Ismael Gutierrez +1 more
openaire +2 more sources
Symplectic Self-Orthogonal Quasi-Cyclic Codes
IEEE Transactions on Information TheoryThis paper was published in IEEE TIT. In this version, we have corrected some minor errors, among which the most significant change is that the constraint $\gcd(\bar{f}_0(x),g(x))=1$ in Theorem 5 has been corrected to $\gcd(f_0(x),g(x))=1$
Chaofeng Guan +3 more
openaire +2 more sources
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
Cyclic Codes over a Non-Local Non-Unital Ring
MathematicsWe study cyclic codes over the ring H of order 4 and characteristic 2 defined by generators and relations as H=⟨a,b∣2a=2b=0,a2=0,b2=b,ab=ba=0⟩. This is the first time that cyclic codes over a non-unitary ring are studied.
Adel Alahmadi +2 more
doaj +1 more source
Quasi-cyclic Flexible Regenerating Codes
, 2012 17 pages, 1 figure, submitted to IEEE Transactions on Information ...
Gastón, Bernat +2 more
openaire +2 more sources