Quasi-Cyclic LDPC Codes for Fast Encoding
From MaRDI portal
Publication:3547422
DOI10.1109/TIT.2005.851753zbMATH Open1310.94192MaRDI QIDQ3547422FDOQ3547422
Authors: Seho Myung, Kyeongcheol Yang, Jaeyoel Kim 
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Recommendations
- LDPC Block and Convolutional Codes Based on Circulant Matrices
- scientific article; zbMATH DE number 6831541
- Efficient encoding of low-density parity-check codes
- A class of quasi-cyclic LDPC codes from \(B_2\pmod m\) sequences
- Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
Cited In (14)
- Design of QC-LDPC codes using Fibonacci sequence
- Title not available (Why is that?)
- Quasi-cyclic LDPC codes of column-weight two using a search algorithm
- Design and efficient hardware implementation schemes for non-quasi-cyclic LDPC codes
- Efficient encoding of low-density parity-check codes
- A class of quasi-cyclic LDPC codes from \(B_2\pmod m\) sequences
- Low complexity construction for quasi-cyclic low-density parity-check codes by progressive-block growth
- A special class of quasi-cyclic low-density parity-check codes based on repetition codes and permutation matrices
- Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
- Construction of the high-rate regular quasi-cyclic LDPC codes
- Constructions of QC LDPC codes based on integer sequences
- New encoding/decoding scheme for rotation LDPC codes
- Title not available (Why is that?)
- Girth expanding algorithm for LDPC code based on cyclic iterative
This page was built for publication: Quasi-Cyclic LDPC Codes for Fast Encoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547422)
