LDPC codes: A group algebra formulation
From MaRDI portal
Recommendations
- An introduction to LDPC codes
- Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding
- Low-density parity-check codes based on finite geometries: a rediscovery and new results
- On Algebraic Construction of Gallager and Circulant Low-Density Parity-Check Codes
- scientific article; zbMATH DE number 2127865
Cites work
- An optimum symbol-by-symbol decoding rule for linear codes
- Fusion, propagation, and structuring in belief networks
- scientific article; zbMATH DE number 1714660 (Why is no real title available?)
- scientific article; zbMATH DE number 3174791 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
Cited in
(6)- A branch-cut-and-price algorithm for optimal decoding in digital communication systems
- LCD codes and self-orthogonal codes in finite dihedral group algebras
- scientific article; zbMATH DE number 1714660 (Why is no real title available?)
- An introduction to LDPC codes
- Verification-Based Decoding for Packet-Based Low-Density Parity-Check Codes
- Construction and Encoding of QC-LDPC Codes Using Group Rings
This page was built for publication: LDPC codes: A group algebra formulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2741404)
