论文标题
构建LG-Matrices和应用的迭代方法
Iterative methods to build LG-matrices and Applications
论文作者
论文摘要
在本文中，我们给出了一种递归算法，以建造两个$（0,1）$的家庭，一个矩阵，一个稀疏的常规和另一个密集。我们研究了用算法构建的两个家族的$（0,1）$矩阵的各种属性。 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.我们确定与拉格朗日 - 格拉斯曼尼亚品种的几何形状相关的唯一$（0,1）$ - 矩阵，UP基础变化。
In this paper we give a recursive algorithm to construct two families of $(0,1)$-matrices, one sparse regular and the other dense. We study various properties of the two families of $(0,1)$-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 $(0,1)$-matrices, up basis change, associated with the geometry of the Lagrangian-Grassmannian variety.
