Self-Dual 自对偶
self-dual codes 自对偶码
self-dual graph 自对偶图
self-dual system 自对偶系统 ; 自对偶系
self-dual linear space [数] 自对偶线性空间
self-dual matroid [数] 自对偶拟阵
self-dual code 自偶码
self-dual matrix 自对偶矩阵
self-dual mds code 自对偶mds码
The equivalence of maximal self-orthogonal codes obtained from binary self-dual codes by truncating are discussed.
研究了自对偶码与其删截得到的极大自正交码的等价性问题。
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.
利用这些自对偶码及构造出的具有较好对偶距离的自正交子码构造出了码链,并且导出相应的L-链。
The paper gives the necessary and sufficient condition of self-dual graphs, all of self-dual graphs can be structured with this necessary and sufficient codition.
给出自对偶图的充要条件,并利用此充要条件,能构造出所有自对偶图。
应用推荐