研究了自对偶码与其删截得到的极大自正交码的等价性问题。
The equivalence of maximal self-orthogonal codes obtained from binary self-dual codes by truncating are discussed.
多年来，有限环上的循环码和自对偶码一直是编码研究者所关心的热点问题。
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.
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.
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.
应用推荐