多年来，有限环上的循环码和自对偶码一直是编码研究者所关心的热点问题。
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.
但通过自对偶码构造的CSS码一定含有长度为4的块环，这对译码具有消极影响。
But CSS codes constructed by dual-containing codes must contain cycles of length 4, which has a negative impact on the decoding.
本文讨论非交换分次环上的纲性分次自对偶与其初始子环上的自对偶之间的关系。
In this paper, we discuss the connection between the rigid graded selfduality over some noncommutative graded ring and the selfduality over its initial subring.
多年来，有限环上的循环码和自对偶码一直是编码研究者所关心的热点问题。
The equivalence of maximal self-orthogonal codes obtained from binary self-dual codes by truncating are discussed.
多年来，有限环上的循环码和自对偶码一直是编码研究者所关心的热点问题。
The equivalence of maximal self-orthogonal codes obtained from binary self-dual codes by truncating are discussed.
应用推荐