Iterative methods to build LG-matrices and Applications
From MaRDI portal
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Canonical forms, reductions, classification (15A21) Special matrices (15B99) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)
Abstract: In this paper we give a recursive algorithm to construct two families of -matrices, one sparse regular and the other dense. We study various properties of the two families of -matrices built with our algorithm. We present a new construction of two clases of isodual linear codes, one is the low density generator matrix codes and other is the dense linear codes, for both codes we obtain the polynomial of the distribution of weights, a bound for the minimum distance and we apply to these codes the efficient encoders based on approximate lower triangulations developed by Richardson-Urbanke. We identify the unique -matrices, up basis change, associated with the geometry of the Lagrangian-Grassmannian variety.
This page was built for publication: Iterative methods to build LG-matrices and Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6348278)
