Linear Programming Decoding of Non-Linear Sparse-Graph Codes.
Gleb BalitskiyAlexey A. FrolovPavel S. RybinPublished in: REDUNDANCY (2021)
Keyphrases
- linear programming
- decoding algorithm
- linear program
- error control
- error correction
- error correcting
- ldpc codes
- parity check
- quadratic programming
- graph representation
- reed solomon
- dynamic programming
- random walk
- low density parity check
- structured data
- gaussian graphical models
- joint source channel
- graph model
- sparse data
- decoding complexity
- directed acyclic graph
- weighted graph
- graph theory
- graph matching
- directed graph
- directed acyclic
- np hard
- optimal solution
- adjacency matrix
- graph structure
- bipartite graph
- high dimension
- error detection
- network flow
- primal dual
- image transmission
- spanning tree
- decoding process
- graph mining
- signal recovery
- connected components
- sparse representation
- special case
- high dimensional
- objective function