On the Encoding Complexity of Quasi-Cyclic LDPC Codes

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

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)

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

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)