Chordal Codes: Code Construction and Efficient Gaussian-Elimination Decoding
Maximum-likelihood decoding of linear codes over erasure channels can be considered as solving a linear system of a column submatrix of the parity-check matrix. In practice, Gaussian elimination is usually applied, and its computational cost depends on the structure of the matrix, especially the sparsity and the fill-i...