Sparsifying Parity-Check Matrices
From MaRDI portal
Publication:6340444
arXiv2005.05051MaRDI QIDQ6340444
Author name not available (Why is that?)
Publication date: 8 May 2020
Abstract: Parity check matrices (PCMs) are used to define linear error correcting codes and ensure reliable information transmission over noisy channels. The set of codewords of such a code is the null space of this binary matrix. We consider the problem of minimizing the number of one-entries in parity-check matrices. In the maximum-likelihood (ML) decoding method, the number of ones in PCMs is directly related to the time required to decode messages. We propose a simple matrix row manipulation heuristic which alters the PCM, but not the code itself. We apply simulated annealing and greedy local searches to obtain PCMs with a small number of one entries quickly, i.e. in a couple of minutes or hours when using mainstream hardware. The resulting matrices provide faster ML decoding procedures, especially for large codes.
Has companion code repository: https://github.com/LuisRusso-INESC-ID/SPCM
This page was built for publication: Sparsifying Parity-Check Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6340444)
