摘要
基于编码理论的实际需要,提出了一个与极大无关组相对称的概念——极小相关组。与极大无关组相比,极小相关组的求解要困难得多。重点探讨了极小相关组的定义及其一些简单性质,旨在抛砖引玉,希望能找到向量组极小相关组的有效求解方法。最后将极小相关组概念应用于线性分组码的纠错能力的计算。
In higher algebra, the definition of maximal finearly independent subset of vector subset is introduced to study the structure of vector space. Based on requirement of coding theory, a new definition ＂minimal linearly dependent subset＂ is offered in this paper compared to maximal linearly independent subset. However it is more difficult to solve minimal linearly dependent subset than maximal linearly independent subset. This paper mainly discusses the definition and some basic properties of minimal linearly dependent subset in order to find out the solving method of minimal finearly dependent subset and finally applies it to calculate the error correction ability of the linear block codes.
出处
《东华理工大学学报（自然科学版）》
CAS
2008年第1期98-100,共3页
Journal of East China University of Technology(Natural Science)
基金
东华理工大学硕士启动基金科研项目(DHS0415)
关键词
极小相关组
距
一致校验矩阵
纠错能力
minimal relevance group
distance
uniform check matrix
error-erasing power
