超正则矩阵与最大距离卷积码的构造
Superregular Matrices and the Construction of Convolutional Codes having a Maximum Distance Profile
摘要:
超正则矩阵是在构造具有最大距离轮廓的卷积码的上下文中出现的一类下三角Toeplitz矩阵。这些矩阵的特点是没有子矩阵有零行列式,除非它是平凡零,由于下三角结构的性质。在本文中,我们讨论如何超正则矩阵可以用来构造代码具有最大的距离配置文件。我们还介绍了群行动,保持超正则性,并提出了一个上限的最小尺寸的有限域必须有一个给定大小的超正则矩阵可以存在于该领域。
英文摘要:
Superregular matrices are a class of lower triangular Toeplitz matrices that arise in the context of constructing convolutional codes having a maximum distance profile. These matrices are characterized by the property that no submatrix has a zero determinant unless it is trivially zero due to the lower triangular structure. In this paper, we discuss how superregular matrices may be used to construct codes having a maximum distance profile. We also introduce group actions that preserve the superregularity property and present an upper bound on the minimum size a finite field must have in order that a superregular matrix of a given size can exist over that field.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。