Optimal interleaving schemes for correcting two-dimensional cluster errors

We present an elementary theory of optimal interleaving schemes for correcting cluster errors in two-dimensional digital data. It is assumed that each data page contains a fixed number of, say n, codewords with each codeword consisting of m code symbols and capable of correcting a single random error (or erasure). The goal is to interleave the codewords in the m×n array such that different symbols from each codeword are separated as much as possible, and consequently, an arbitrary error burst with size up to t can be corrected for the largest possible value of t. We show that, for any given m, n, the maximum possible interleaving distance, or equivalently, the largest size of correctable error bursts in an m×n array, is given by if n?⌈m²/2⌉, and t=m+⌊(n-⌈m²/2⌉)/m⌋ if n?⌈m²/2⌉. Furthermore, we develop a simple cyclic shifting algorithm that can provide a systematic construction of an m×n optimal interleaving array for arbitrary m and n. This extends important earlier work on the complementary problem of constructing interleaving arrays that, given the burst size t, minimize the interleaving degree, that is, the number of different codewords in a 2-D (or 3-D) array such that any error burst with given size t can be corrected. Our interleaving scheme thus provides the maximum burst error correcting power without requiring prior knowledge of the size or shape of an error burst.     

一种基于背包问题的可纠错数字签名方案

基于超递增向量背包问题的可解性,提出一种可纠错数字签名方案。该方案能纠正在网络传输中出错的消息,证明了该方案的安全性。并比较了其与几个纠错数字签名方案的效率,结果证明,该方案具有较好的性能。     

MATLAB在有限域教学中的应用

在＂代数与编码＂课程中,有限域理论是学习纠错码的基础。学生普遍感到有限域理论抽象难懂。在有限域的理论教学中应用MATLAB,不仅激发了学生的学习兴趣,而且加深了学生对有限域理论的理解。     

可用于SRAM PUF的密钥提取方案

为了利用PUF获得芯片唯一、随机的密钥,详细分析可用于SRAM PUF的密钥提取方案,包括采用级联纠错码的硬判决和软判决译码方案。利用芯片上的实际SRAM PUF响应和软件仿真,验证两种方案的效果。结果表明,对于SRAM PUF,软判决方案更加可靠和高效。     

Error-Correcting Codes from Higher-Dimensional Varieties

In this paper we use intersection theory to develop methods for obtaining lower bounds on the parameters of algebraic geometric error-correcting codes constructed from varieties of arbitrary dimension. The methods are sufficiently general to encompass many of the codes previously constructed from higher-dimensional varieties, as well as those coming from curves. And still, the bounds obtained are usually as good as the ones previously known (at least of the same order of magnitude with respect to the size of the ground field). Several examples coming from Deligne–Lusztig varieties, complete intersections of Hermitian hyper-surfaces, and from ruled surfaces (or more generally, projective bundles over a curve) are given.     

直接检测光PPM系统中RS码的性能分析

研究了大小不同域上的RS码用于直接检测数字脉位调制(PPM)系统时的性能;对散弹噪声限下的Poisson和Gauss两种光电子计数模型分别导出了码符和调制符号不同对应关系下的最大似然译码量度、性能限以及硬判决译码时的性能计算公式,为实际设计中码参数的选择提供了理论依据.     

Construction of Binary Quantum Error-Correcting Codes from Orthogonal Array

By using difference schemes, orthogonal partitions and a replacement method, some new methods to construct pure quantum error-correcting codes are provided from orthogonal arrays. As an application of these methods, we construct several infinite series of quantum error-correcting codes including some optimal ones. Compared with the existing binary quantum codes, more new codes can be constructed, which have a lower number of terms (i.e., the number of computational basis states) for each of their basis states.     

液压伺服控制带材“跑偏”系统的模糊控制研究

带材的“跑偏”控制广泛应用于各类卷绕机构中，探索和研制“跑偏”控制系统不仅具有理论意义，而且具有实用价值笔者将模糊控制理论引入“跑偏”控制领域，主要介绍了液压伺服控制“跑偏”系统的模糊控制系统、模糊控制器的设计方法及控制软件的组成实验研究表明，这种方法响应快、精度高、实时性较好     

Designs in Additive Codes over GF(4)

In this paper we discuss the security of digital signature schemes based on error-correcting codes. Several attacks to the Xinmei scheme are surveyed, and some reasons given to explain why the Xinmei scheme failed, such as the linearity of the signature and the redundancy of public keys. Another weakness is found in the Alabbadi-Wicker scheme, which results in a universal forgery attack against it. This attack shows that the Alabbadi-Wicker scheme fails to implement the necessary property of a digital signature scheme: it is infeasible to find a false signature algorithm D from the public verification algorithm E such that E(D ( )) = for all messages . Further analysis shows that this new weakness also applies to the Xinmei scheme.     

捕错译码法的软件实现

提出用软件方法实现修改的捕错译码法．以拓宽捕错译码法的应用范围．这种译码方法译码速度快．其时间与多项式集合｛Ｑｊ（Ｘ）｝中多项式个数成正比．该方法适于纠错能力低的码、对大纠错能力的码．只纠正其少量错误时．这种译码方法有很强的超限译码能力．特别适于混合ＡＲＱ差错控制系统．