基于最大秩距离码的公钥密码系统

秩距离码及最大秩距离码的概念是由Gabidulin首先提出的，由于秩距离的特点，利用秩距离码构造的各种密码体制和认证系统的安全性比汉明距离度量的码更高。利用最大秩距离码，提出了新的McElience公钥密码系统，讨论了其可行性及安全性，证明了它比基于纠错码的McElience公钥密码系统更安全。而且，通过引入单向杂凑函数，使密码系统能有效的抗击消息重发攻击和相关消息攻击。     

极化码与奇偶校验码的级联编码：面向5G及未来移动通信的编码方案

基于信道极化 定理而提出的极化码是目前唯一被严格理论证明可以达到香农容量限的编码,并被接受为第五代移动通信系统（5G）中短码控制信道的编码方案。本文首先给出极化码的编码和译码原理,然后提出一种极化码与奇偶校验码级联的设计方案,发送端编码器采用奇偶校验码作为外码,极化码作为内码的级联编码结构。接收端译码器采用基于奇偶校验辅助的连续消 除列表译码算法。相比于极化码与循环冗余校验码的级联方案,本文提出的级联设计方案具有更加优良的纠错性能,且没有提升编、译码的复杂度,有能力满足5G移动通信控制信道对纠错性能的要求。     

利用立方图的线图构造量子纠错码

量子纠错码在量子通信和量子计算中起着非常重要的作用,之前的量子纠错码的构造大部分都是利用经典的纠错码来构造得到,如Hamming码,BCH码,RS码,Reed-Muller码等各种经典纠错码。目前,很少有人利用图生成的线性码方法来构造量子纠错码,提出了一个新的构造量子纠错码和非对称量子纠错码的方法,即利用[n]立方图的线图生成的二元线性码来构造量子纠错码和非对称量子纠错码,得到了一类新的量子纠错码和非对称量子纠错码,并且,当码字的长度较大时,对所构造的非对称量子纠错码,在非对称信道上有更大的纠错能力。     

锅炉承压管道检测机器人通讯的纠错编码

介绍了承压管道检测机器人多级通讯中的纠错编码．机器人采用8位单片机作为 控制器，针对其特点，采用BCH码作为多级通讯的纠错编码，文中给出了BCH的结构．为提高 通讯过程的实时性，采用软件快速查表法实现BCH的编码及译码．离线计算出纠错编码表、 伴随式表以及与伴随式对应的正确信息码表，通讯过程中复杂的编码、解码过程变为快速查 表过程，可精确检测并纠正所有错误位数不大于2的误码．为提高查表效率，采用折半查表 法以及索引查表法．     

基于分圆陪集非二进制量子码的构造方法

为了有效克服量子信息处理过程中存在的量子比特消相干,提出了一种基于分圆陪集非二进制量子纠错码的构造方法。分析了分圆陪集的相关性质,确定BCH码包含其Euclidean对偶码的生成多项式,利用扩展的Calderbank-
Shor-Steane（CSS）构造即Steane’s构造方法,构造出一批新的非二进制量子码。通过与已有的量子纠错码相比,结果表明,采用基于分圆陪集非二进制量子码构造方法构造的参数更优。     

曲面体线图的标记与匹配

三维曲面体的标记与匹配,是计算机视觉研究领域中一项相当有用但又是非常困难的技术。本文讨论了一种曲面体标记的新方法。通过引入线段的一些新的标记类型,圆满地解决了利用 Huffman 标记技术描述曲面体时,可能出现的不一致性。根据以上的标记结果,本文还给出了一匹配曲面体线图的新方法。在匹配过程中,我们注重的不是图象的二维特征,而是其对应的物体的三维特征,因而对物体的旋转、遮挡、尺度变化及远视失真等极不敏感。实验结果表明本算法是相当令人满意的。     

基于卷积码的Turbo码交织器的设计

以（３７,２１）ＰＳＣ码为例,提出对基于卷积码的Ｔｕｒｂｏ码的交织器的设计方案,并推广到一般的ＲＳＣ码．分析了该交织对Ｔｕｒｂｏ码距离谱的影响．给出了动用该交织后分量码的选取原则．可以看到,该交织器设计方案在误比特率为１０＾－５时将产生明显的作用．     

基于运动矢量的视频隐写方法

为减小秘密信息嵌入对载体视频的修改率,提出了一种基于运动矢量及线性分组码的视频隐写方法。该方法在原始视频进行H.264压缩过程中将秘密信息嵌入到其运动矢量中。线性分组码的使用不仅可大幅提高载体视频的运动矢量利用率,而且可有效降低运动矢量修改率。所提算法不仅具有计算复杂度低、视觉不可见性高的特点,而且可以实现秘密信息的盲提取。实验表明,该方法在保持良好的视频质量的前提下,可以满足隐蔽通信对于高嵌入容量的需求。     

Secret sharing schemes from binary linear codes

In principle, every linear code can be used to construct a secret sharing scheme. However, in general, determining the access structure of the scheme is very hard. On the other hand, finding error correcting codes that produce secret sharing schemes with efficient access structures is also difficult. In this paper, we study a set of minimal codewords for certain classes of binary linear codes, and then determine the access structure of secret sharing schemes based on these codes. Furthermore, we prove that the secret sharing schemes obtained are democratic in the sense that every participant is involved in the same number of minimal access sets.     

一种可认证密钥分配方案

给出一种新的可认证密钥分配方案，该方案基于差错控制编码理论中的系统线性分组码，而不使用任何加算法，它不仅对于抵御内外攻击者的攻击具有较高的安全性，而且还可以提高通信的可靠性。     

两个非对称图量子MDS码的构造

量子纠错编码技术在量子信息理论中一直以来有着重要的地位,在量子纠错编码方案中,Schingemann和Werner两人提出了通过构造具有某些性质的图（矩阵）来构造非二元量子码的方法,他们利用这种图论方法构造出很多好的量子码,特别给出量子码[[[5,1,3]]p][(p≥3)]存在性的一个新证明。此方法可从对称量子码推广至非对称量子码的构造,利用推广方法证明了非对称图量子MDS码[[[5,1,4/2]]p],[(p>5)]和[[[7,1,6/2]]p][(p>7)]的存在性。     

量子纠错码的一个统一构造方法

在量子通信和量子计算中,量子纠错码起着至关重要的作用。人们已经利用Hamming码、BCH码、Reed-Solomon码等各种循环码、常循环码、准循环码来构造量子纠错码。利用准缠绕码将这些构造方法统一起来,给出了准缠绕码包含其对偶码的充分必要条件及准缠绕码的一个新构造方法,并且利用准缠绕码构造了新的量子纠错码。     

Tree searched chain coding for subpixel reconstruction of planarcurves

Coding schemes for the quantization of line drawings that outperform basic chain codes are investigated. First, subpixel accuracy reconstruction is obtained by a simple linear filtering of the chain code points, which achieves a factor-of-three to-four reduction in average reconstruction distortion for smooth curves. Second, the basic chain encoding schemes are generalized to a multipath-tree-searched encoding scheme. A variation of the (M,L)-algorithm is used to maintain M contending chain code paths in storage and choose the best path from these. Over a wide variety of source curves, tree-searched chain coding results in nearly an order of magnitude reduction in average reconstruction distortion over smoother chain codes. The performance improvement for curves is obtained with only a slight increase in bit rate over basic chain codes     

曲面立体线图的补线技术研究

文中根据已有的曲面立体自然线图的标记原理，得到了曲面立体画隐线图的标记原理和方法。曲面立体的不完整线图中的L型节点是曲面立体完整线图中W型节点的退化。基于曲面立体画出隐藏线的完整线图标记原理和方法，详细分析并建立了曲面立体不完整线图中L型节点与曲面立体完整线图中W型节点的对应关系。提出了曲面立体不完整线图的标记和补线方法，结合算例详细论述了曲面立体不完整线图的标记和补线过程，从曲面立体不完整线图获得了合理的曲面立体完整线图。     

Involution codes: with application to DNA coded languages

For an involution θ : Σ^* → Σ^* over a finite alphabet Σ we consider involution codes: θ-infix, θ-comma-free, θ-k -codes and θ-subword-k-codes. These codes arise from questions on DNA strand design. We investigate conditions under which both X and X⁺ are same type of involution codes. General methods for generating such involution codes are given. The information capacity of these codes show to be optimized in most cases. A specific set of these codes was chosen for experimental testing and the results of these experiments are presented.     

有门限可认证的多重秘密密钥协商方案

密钥管理是信息安全中的一个重要领域，密钥协商是密钥管理中的一个重要方面。基于线性码理论给出了一个计算安全的有门限可认证的多重秘密密钥协商方案。该方案使得参与者可以协商秘密密钥，而不用基于离散对数假设。参与秘密密钥协商的参与者组成的集合必须满足门限要求才能进行秘密密钥协商；同时协商的秘密密钥具有多重性，即进行一次秘密协商，可产生出多个秘密密钥。该方案基于线性码理论，可以进行验证，具有认证功能，能够防止第三方攻击。     

Similarity-based image retrieval system using partitioned iterated function system codes

We propose a new image retrieval system using partitioned iterated function system (PIFS) codes. In PIFS encoding, a compression code contains mapping information between similar regions in the same image. This mapping information can be treated as vectors, and representative vectors can be generated using them. Representative vectors describe the features of the image. Hence, the similarity between images is directly calculable from representative vectors. This similarity is applicable to image retrieval. In this article, we explain this scheme and demonstrate its efficiency experimentally. This work was presented, in part, at the 8th International Symposium on Artificial Life and Robotics, Oita, Japan, January 24#x2013;26, 2003     

SCMA与极化码的联合检测译码技术

将极化码与SCMA多址系统相结合,并针对传统的独立检测译码方案（independent detection and decoding,IDD）因缺乏对译码输出信息的再利用而导致系统性能不佳的问题,提出了SCMA以及极化码联合检测译码方案（joint detection and decoding,JDD）。该方案在接收端借助译码获得的内信息辅助更新SCMA多用户检测器的初始先验信息,在检测器与译码器之间实现软信息的回溯迭代,从而得到更显著的系统性能增益。仿真结果表明采用了JDD方案的系统性能相比IDD方案得到了显著的提升,误码率相较IDD方案提升了大约2 dB。     

Design of efciently encodable nonbinary LDPC codes for adaptive coded modulation

This paper is concerned with constructions of nonbinary low-density parity-check(LDPC)codes for adaptive coded modulations(ACM).A new class of efciently encodable structured nonbinary LDPC codes are proposed.The defining parity-check matrices are composed of scalar circulant sub-matrices which greatly reduce the storage requirement when compared with random LDPC codes.With this special structure of paritycheck matrix,an efcient encoding algorithm is presented.Based on the proposed codes,a family of variablerate/variable-field nonbinary LDPC codes is designed for the ACM system.When combined with matched-size signal constellations,the family of constructed codes can achieve a wide range of spectral efciency.Furthermore,the resultant ACM system can be implemented via a set of encoder and decoder.Simulation results show that the proposed nonbinary LDPC codes for the ACM system perform well.     

Remarks concerning the optimization of matrix codes

This paper describes the results of a general theory of matrix codes correcting a set of given types of multiple errors. A detailed study has been made of certain matrix classes of these systematic binary error correcting codes that will correct typical errors of some digital channels. These codes published by Elias,^(2,3) Hobb's,⁽⁵⁾ and Voukalis⁽¹¹⁾ account for this theory and other new families of binary systematic matrix codes of arbitrary size, correcting random, burst and clusters of errors are given here. Also presented here are the basic ideas of each of these codes. We can easily find practical decoding algorithms for each of these codes. The characteristic calculation of the parity check equations that the information matrix codebook has to satisfy are also shown. Further on we deal with the optimum construction of these codes showing their use in certain applications. We answer questions such as: “What is the optimum size of the code?” “What is the best structure of the code?” “What is the probability of error correction and the mean error correction performance?” Consequently, in this paper we also describe the results of an extensive search for optimum matrix codes designed to correct a given set of multiple errors as well as their implementation.