⌘+K

Pulse Explore Clubs Researchers Journals

Home Clubs Explore

July 27, 2004IEEE Transactions on Information Theory

Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices

View Full Paper

Ask AI

Bookmark

Share

Authors

MFM.P.C. FossorierUniversity of Hawaiʻi at Mānoa

Discussion

Loading...

Member takes

Implication

Key Points

Key points are not available for this paper at this time.

Cite This Study

M.P.C. Fossorier (2004) studied this question.

synapsesocial.com/papers/69da15f7b48bb130d468407d https://doi.org/10.1109/tit.2004.831841

View Full Paper

Ask AI

Bookmark

Share

Also Consider

Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context:

1Efficient erasure correcting codes2001 · 1,187 citations
2Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding2004 · 263 citations
3Iterative decoding of one-step majority logic deductible codes based on belief propagation2000 · 170 citations
4Good error-correcting codes based on very sparse matrices1999 · 3,729 citations