On the Encoding Complexity of Quasi-Cyclic LDPC Codes

DOI10.1109/TSP.2015.2463258zbMATH Open1395.94350OpenAlexW1613696163MaRDI QIDQ4580921FDOQ4580921

Authors Ahmed Mohsin Mahdi, Vassilis Paliouras

Publication date 22 August 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2015.2463258

Mathematics Subject Classification ID

Cyclic codes (94B15)

Cited in

(10)

• scientific article; zbMATH DE number 6874357 (Why is no real title available?)
• A matrix-theoretic approach for analyzing quasi-cyclic low-density parity-check codes
• An updated table of rate \(1/p\) binary quasi-cyclic codes
• scientific article; zbMATH DE number 5584715 (Why is no real title available?)
• On quasi-cyclic codes with rate l m (Corresp.)
• On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\)
• Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach
• scientific article; zbMATH DE number 6831541 (Why is no real title available?)
• scientific article; zbMATH DE number 6907319 (Why is no real title available?)
• LDPC Codes Over the $q$ -ary Multi-Bit Channel

This page was built for publication: On the Encoding Complexity of Quasi-Cyclic LDPC Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580921)