Improved construction of LDPC convolutional codes with semi-random parity-check matrices
From MaRDI portal
Publication:893659
DOI10.1007/S11432-013-5049-5zbMATH Open1357.94086OpenAlexW2019633841MaRDI QIDQ893659FDOQ893659
Authors: Liwei Mu, Xingcheng Liu, Chulong Liang
Publication date: 20 November 2015
Published in: Science China Information Sciences (Search for Journal in Brave)
Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-013-5049-5
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
- Title not available (Why is that?)
- An algorithm for counting short cycles in bipartite graphs
- Design of capacity-approaching irregular low-density parity-check codes
- Time-varying periodic convolutional codes with low-density parity-check matrix
- Deriving Good LDPC Convolutional Codes from LDPC Block Codes
- Title not available (Why is that?)
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
Uses Software
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)