Parallel turbo-sum-product decoder architecture for quasi-cyclic LDPC codes
GLSVLSI '06 Proceedings of the 16th ACM Great Lakes symposium on VLSI
Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
Designs, Codes and Cryptography
Quasi-cyclic LDPC codes of column-weight two using a search algorithm
EURASIP Journal on Applied Signal Processing
A memory efficient partially parallel decoder architecture for quasi-cyclic LDPC codes
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Quasi-cyclic LDPC codes of column-weight two using a search algorithm
EURASIP Journal on Advances in Signal Processing
Optimal overlapped message passing decoding of quasi-cyclic LDPC codes
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
On the Minimum Weight of Simple Full-Length Array LDPC Codes
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Low-complexity high-speed decoder design for quasi-cyclic LDPC codes
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Low Complexity Decoder Architecture for Low-Density Parity-Check Codes
Journal of Signal Processing Systems
Geometrically-structured maximum-girth LDPC block and convolutional codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Efficient encoding of QC-LDPC codes related to cyclic MDS codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
High-throughput layered decoder implementation for quasi-cyclic LDPC codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Convergence analysis of generalized serial message-passing schedules
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
LDPC codes based on serially concatenated multiple parity-check codes
IEEE Communications Letters
Hybrid burst erasure correction of LDPC codes
IEEE Communications Letters
Large girth quasi-cyclic LDPC codes based on the Chinese remainder theorem
IEEE Communications Letters
A class of generalized LDPC codes with fast parallel decoding algorithms
IEEE Communications Letters
Shortening for irregular QC-LDPC codes
IEEE Communications Letters
IEEE Transactions on Communications
Design of low-rate irregular LDPC codes using trellis search
IEEE Transactions on Communications
Design of a multimode QC-LDPC decoder based on shift-routing network
IEEE Transactions on Circuits and Systems II: Express Briefs
Finding all small error-prone substructures in LDPC codes
IEEE Transactions on Information Theory
Reversible low-density parity-check codes
IEEE Transactions on Information Theory
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
On the designs and challenges of practical binary dirty paper coding
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Cooperative relay channel with LDPC codes constructed from array codes
WTS'09 Proceedings of the 2009 conference on Wireless Telecommunications Symposium
Analysis of LDPC decoding schedules
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Short quasi-cyclic LDPC codes from convolutional codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Some low-density parity-check codes derived from finite geometries
Designs, Codes and Cryptography
Graph-based convolutional and block LDPC codes
Problems of Information Transmission
Design of multiple serially concatenated multiple parity-check codes for wireless applications
SoftCOM'09 Proceedings of the 17th international conference on Software, Telecommunications and Computer Networks
A lattice-based systematic recursive construction of quasi-cyclic LDPC codes
IEEE Transactions on Communications
Burst erasure correcting LDPC codes
IEEE Transactions on Communications
Construction of QC LDPC codes based on cyclic subgroup over GF(q)
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Hardware designing for ABS-S modulator
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
A class of QC-LDPC codes with low encoding complexity and good error performance
IEEE Communications Letters
Construction of nonbinary quasi-cyclic LDPC cycle codes based on singer perfect difference set
IEEE Communications Letters
Comment on "quasi-cyclic low density parity check codes from circulant permutation matrices"
IEEE Transactions on Information Theory
On quasi-cyclic codes over integer residue rings
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
A low-complexity message-passing algorithm for reduced routing congestion in LDPC decoders
IEEE Transactions on Circuits and Systems Part I: Regular Papers - Special issue on ISCAS 2009
Trends and challenges in LDPC hardware decoders
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Quasi-cyclic LDPC codes: an algebraic construction, rank analysis, and codes on Latin squares
IEEE Transactions on Communications
Large-girth nonbinary QC-LDPC codes of various lengths
IEEE Transactions on Communications
Efficient decoding of QC-LDPC codes using GPUs
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
Improved Sliced Message Passing Architecture for High Throughput Decoding of LDPC Codes
Journal of Signal Processing Systems
Matrix Merging Scheme and Efficient Decoding Techniques for Reconfigurable QC-LDPC Decoders
Journal of Signal Processing Systems
Modified Shuffled Based Architecture for High-Throughput Decoding of LDPC Codes
Journal of Signal Processing Systems
Message length adaptive LDPC codes
Digital Signal Processing
Biometric cryptosystem based on discretized fingerprint texture descriptors
Expert Systems with Applications: An International Journal
Low-density parity-check codes based on steiner systems and permutation matrices
Problems of Information Transmission
| Hi-index | 755.02 |
In this correspondence, the construction of low-density parity-check (LDPC) codes from circulant permutation matrices is investigated. It is shown that such codes cannot have a Tanner graph representation with girth larger than 12, and a relatively mild necessary and sufficient condition for the code to have a girth of 6, 8,10, or 12 is derived. These results suggest that families of LDPC codes with such girth values are relatively easy to obtain and, consequently, additional parameters such as the minimum distance or the number of redundant check sums should be considered. To this end, a necessary condition for the codes investigated to reach their maximum possible minimum Hamming distance is proposed.