arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1604.07665cs.ITmath.IT
收藏

关于联合超正则下三角Toeplitz矩阵的构造

On the Construction of Jointly Superregular Lower Triangular Toeplitz Matrices

Jonas Hansen, Jan Østergaard, Johnny Kudahl, John H. Madsen

摘要:

超正则矩阵具有所有能满秩的子矩阵都能满秩的性质。下三角超正则矩阵对于例如,最大距离可分离卷积码以及(顺序)网络码。在这项工作中,我们提供了一个显式设计的所有超正则下三角Toeplitz矩阵GF(2 ^p)的情况下,矩阵的维数小于或等于5 × 5。对于高维矩阵,我们提出了一个贪心算法,找到一个解决方案提供的字段大小是足够高的。我们还引入了联合超正则矩阵和保积联合超正则矩阵的概念,并将我们的超正则矩阵的显式构造扩展到这些情况。联合超正则矩阵是必要的,以实现最佳的解码能力的情况下,码的速率低于1/2,和产品保持性能是必要的最佳解码能力在网络重编码。

英文摘要:

Superregular matrices have the property that all of their submatrices, which can be full rank are so. Lower triangular superregular matrices are useful for e.g., maximum distance separable convolutional codes as well as for (sequential) network codes. In this work, we provide an explicit design for all superregular lower triangular Toeplitz matrices in GF(2^p) for the case of matrices with dimensions less than or equal to 5 x 5. For higher dimensional matrices, we present a greedy algorithm that finds a solution provided the field size is sufficiently high. We also introduce the notions of jointly superregular and product preserving jointly superregular matrices, and extend our explicit constructions of superregular matrices to these cases. Jointly superregular matrices are necessary to achieve optimal decoding capabilities for the case of codes with a rate lower than 1/2 , and the product preserving property is necessary for optimal decoding capabilities in network recoding.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑