研究了自对偶码与其删截得到的极大自正交码的等价性问题。
The equivalence of maximal self-orthogonal codes obtained from binary self-dual codes by truncating are discussed.
建立了线性模糊纠错码的概念，研究了生成阵、校验阵、对偶码等性质。
Linear fuzzy error correcting code is discussed and such basic properties of linear fuzzy error correcting code as generator matrix, dual code and so on are studied.
多年来，有限环上的循环码和自对偶码一直是编码研究者所关心的热点问题。
In the last ten or more years, the cyclic codes and self-dual codes over finite rings have become a hot issue for coding theorists.
多年来，有限环上的循环码和自对偶码一直是编码研究者所关心的热点问题。
The equivalence of maximal self-orthogonal codes obtained from binary self-dual codes by truncating are discussed.
但通过自对偶码构造的CSS码一定含有长度为4的块环，这对译码具有消极影响。
But CSS codes constructed by dual-containing codes must contain cycles of length 4, which has a negative impact on the decoding.
利用这些自对偶码及构造出的具有较好对偶距离的自正交子码构造出了码链，并且导出相应的L-链。
The series of the self-dual and self-orthogonal chains are constructed by these matrixes and the subcodes' L-chains with maximal dual distance are deduced.
从算法流程图和序码分析两个方面进行外部调序，用码位倒置和对偶演化相结合进行内部调序。
By means of the dual evolution, the external and internal ordering technique for the Walsh transform (FWT) was introduced and four kinds of ordering analyzed respectively.
CSS码作为其中一类具有特殊结构的稳定子码，可以由一个自对偶或一对满足扭关系的经典二元线性码构造。
As a class of stabilizer codes with special structures, CSS codes can be constructed by a dual-containing binary linear code or a pair of classical binary linear codes with twisted relation.
采用了一种可以避免求逆运算的修正BM迭代算法，并且利用这样的迭代算法和基于弱对偶基的比特并行乘法器构成了广泛应用的RS码的译码器。
By selecting the bit parallel multiplier based on WDB and the modified BM iterative algorithm that can avoid inversion, the widely used rs decoder is constructed.
采用了一种可以避免求逆运算的修正BM迭代算法，并且利用这样的迭代算法和基于弱对偶基的比特并行乘法器构成了广泛应用的RS码的译码器。
By selecting the bit parallel multiplier based on WDB and the modified BM iterative algorithm that can avoid inversion, the widely used rs decoder is constructed.
应用推荐