Improved construction of LDPC convolutional codes with semi-random parity-check matrices
From MaRDI portal
Recommendations
- LDPC Block and Convolutional Codes Based on Circulant Matrices
- scientific article; zbMATH DE number 6672322
- scientific article; zbMATH DE number 1714649
- Construction of time-invariant LDPC convolutional codes with modified method
- A method of restructuring LDPC parity-check matrix
- Low density parity check convolutional codes derived from quasi-cyclic block codes
- Deriving Good LDPC Convolutional Codes from LDPC Block Codes
- Construction of rate-compatible LDPC codes utilizing information shortening and parity puncturing
Cites work
- scientific article; zbMATH DE number 3174791 (Why is no real title available?)
- scientific article; zbMATH DE number 3196560 (Why is no real title available?)
- An algorithm for counting short cycles in bipartite graphs
- Deriving Good LDPC Convolutional Codes from LDPC Block Codes
- Design of capacity-approaching irregular low-density parity-check codes
- Time-varying periodic convolutional codes with low-density parity-check matrix
Cited in
(7)- Construction of time-invariant LDPC convolutional codes with modified method
- Construction of LDPC convolutional codes via difference triangle sets
- Time-varying periodic convolutional codes with low-density parity-check matrix
- Pseudocodeword Performance Analysis for LDPC Convolutional Codes
- Asymptotically good convolutional codes
- A public key cryptosystem based on data complexity under quantum environment
- Rapid solution of problems by quantum computation
This page was built for publication: Improved construction of LDPC convolutional codes with semi-random parity-check matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q893659)