On a Family of Circulant Matrices for Quasi-Cyclic Low-Density Generator Matrix Codes
arXiv:1309.1286 · doi:10.1109/TIT.2011.2161953
Abstract
We present a new class of sparse and easily invertible circulant matrices that can have a sparse inverse though not being permutation matrices. Their study is useful in the design of quasi-cyclic low-density generator matrix codes, that are able to join the inner structure of quasi-cyclic codes with sparse generator matrices, so limiting the number of elementary operations needed for encoding. Circulant matrices of the proposed class permit to hit both targets without resorting to identity or permutation matrices that may penalize the code minimum distance and often cause significant error floors.
arXiv comment27 pages, 7 figures
References in corpus (1)
Cited by in corpus (8)
- Security and complexity of the McEliece cryptosystem based on QC-LDPC codes
- Optimization of the parity-check matrix density in QC-LDPC code-based McEliece cryptosystems
- Array Convolutional Low-Density Parity-Check Codes
- Soft McEliece: MDPC code-based McEliece cryptosystems with very compact keys through real-valued intentional errors
- Advanced channel coding for space mission telecommand links
- Progressive Differences Convolutional Low-Density Parity-Check Codes
- Using LDGM Codes and Sparse Syndromes to Achieve Digital Signatures
- Low-power Secret-key Agreement over OFDM