The generalized inverses of systematic non-square binary matrices have applications in mathematics, channel coding and decoding, navigation signals, machine learning, data storage and cryptography such as the McEliece and Niederreiter public-key cryptosystems.
A systematic non-square $(n-k) times k$ matrix $H$, $n > k$, has $2^{ktimes(n-k)}$ different generalized inverse matrices.
This paper presents an algorithm for generating these matrices and compares it with two well-known methods, i.e. Gauss-Jordan elimination and Moore-Penrose methods. A random generalized inverse matrix construction method is given which has a lower execution time than the Gauss-Jordan elimination and Moore-Penrose approaches.
A systematic non-square $(n-k) times k$ matrix $H$, $n > k$, has $2^{ktimes(n-k)}$ different generalized inverse matrices.
This paper presents an algorithm for generating these matrices and compares it with two well-known methods, i.e. Gauss-Jordan elimination and Moore-Penrose methods. A random generalized inverse matrix construction method is given which has a lower execution time than the Gauss-Jordan elimination and Moore-Penrose approaches.
More Stories
Hidden Stabilizers, the Isogeny To Endomorphism Ring Problem and the Cryptanalysis of pSIDH
$mathsf{Skye}$: A Fast KDF based on Expanding PRF and its Application to Signal
Bounded Verification for Finite-Field-Blasting (In a Compiler for Zero Knowledge Proofs)