Generation of Luby transform codes with low redundancy

DOI10.1142/S0218127415500728MaRDI QIDQ5499875zbMATH OpenOpenAlexFDO

Authors

Publication date 5 August 2015

Published in International Journal of Bifurcation and Chaos in Applied Sciences and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218127415500728

zbMATH Keywords

binary erasure channellow redundancyLuby transform codeTanner graph

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35)

Recommendations

• Low redundancy LT code based on arithmetic coding and its application in secure communication
• Scale-free Luby transform codes
• A joint degree distribution LT codes design
• A Luby transform coding and decoding algorithm with error detection and tolerance ability
• Efficient encoding of low-density parity-check codes

Cites work

• LT-W: Improving LT Decoding With Wiedemann Solver

Cited in

(6)

• Low redundancy LT code based on arithmetic coding and its application in secure communication
• Finite length systematic LT codes based on superposing degree distribution
• An MP decoder with error correction codes based on single feedback SLT codes
• Scale-free Luby transform codes
• A Luby transform coding and decoding algorithm with error detection and tolerance ability
• A joint degree distribution LT codes design

This page was built for publication: Generation of Luby transform codes with low redundancy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5499875)