Performance of Error-Correcting Codes on Channels with Memory

Most magnetic recording and many other digital communication channels exhibit statistical dependencies among errors. The design of error-control schemes for such channels .requires proper models and tools that can be used to evaluate error performance after decoding. In this paper a simplified partitioned model of a channel with memory suggested by B. D. Fritchman is considered. This model is used to derive expressions for block and bit error probability bounds for major block burst-error-correcting codes: interleaved, single burst-correcting, and nonbiuary codes. The model-based bounds are compared to the experimental ones using the data obtained for helical scan magnetic tape recorders. The comparison showed an agreement between experimental and analytical data within one order of magnitude, with the average difference being as small as 16 percent in some cases. A simple and effective implementation of a multiple burst-error-correcting scheme based on the majority-logic decoding of interleaved binary codes is suggested. The scheme requires about ten off-the-shelf IC's for both encoder and decoder with the interleaving degree up to 512.     

Application of Error-Correcting Codes in Computer Reliability Studies

The use of error-correcting codes as one of the important techniques to increase computer system reliability is introduced. The different codes used in the central processing unit (CPU) are described. Since the CPU usually contains the data path, logic, and arithmetic units, the codes used in this area are error-detecting codes, such as parity check codes and residue codes. The codes used or suggested for the memory system are discussed, emphasis being placed on parity check codes, two-dimensional codes, Hamming codes and other recently developed codes. The various codes used in the input/output system are presented. The input/output area of the computer system is relatively unreliable as compared with CPU or memory; therefore, error-correcting codes used in this area usually are much more powerful than single parity check codes. These include codes for the magnetic tape, disk, and drum units. The error coding techniques are compared with other techniques for increasing computer system reliability. The future trend of using error-correcting codes in a computer system is also discussed.     

ECOC多类分类研究综述

纠错输出编码能有效地将多类问题转化为二类问题进行求解,已受到国内外从事机器学习的研究者们的重视,并使其成为多类分类领域的研究热点.本文首先分析了ECOC多类分类的原理和框架,指出解决ECOC多类分类问题的关键在于解码策略和编码策略的确定;然后从这两个关键点出发综述了ECOC多类分类的最新进展和应用领域;最后指出了目前存在的问题以及下一步研究方向.论文研究成果将为基于ECOC多类分类方法在实际应用过程中起借鉴和参考作用.     

一种新型的信道纠错编码——之型码

提出了一种新型的纠错码－之型码,它可形成非常简捷的罗软输入／软输出译码规则,而且仿真结果表明,其性能在误比特率为10^-5处距香农理论极限仅0．9dB。     

纠错码数字签名方案的修正

对基于纠错码基础上构造的Xin-mei数字签名方案进行了修正,并指出在目前已知攻击方法下修正方案是安全的.     

分裂认证码与纠错码

引入I-t-分裂认证码的概念。由有分裂的认证码得到纠错码,说明了当替换攻击成功的极大概率等于冒充攻击成功的极大概率时,信源数随编码规则数增大成线性增加,这一结论在无分裂认证码的情况下也成立。     

RFID Authentication Protocols Based on Error-Correcting Codes: A Survey

Code-based cryptography is a very promising research area. It allows the construction of different cryptographic mechanisms (e.g. identification protocol, public-key cryptosystem, etc.). McEliece cryptosystem is the first code-based public-key cryptosystem; several variants of this cryptosystem were proposed to design various security protocols in different systems. In this paper, we present a survey on various and recent authentication protocols in radio frequency identification systems which use diverse variants of the McEliece cryptosystem. Moreover, we discuss the security and the performance of each presented protocol.

     

Error-Correcting Codes for Automatic Control

Systems with automatic feedback control may consist of several remote devices, connected only by unreliable communication channels. It is necessary in these conditions to have a method for accurate, real-time state estimation in the presence of channel noise. This problem is addressed, for the case of polynomial-growth-rate state spaces, through a new type of error-correcting code that is online and computationally efficient. This solution establishes a constructive analog, for some applications in estimation and control, of the Shannon coding theorem.      

新的量子纠错码的构造

量子纠错码在量子通信和量子计算中起到非常关键的作用。文中首次利用三元图上的线性码来构造新的三元量子码,并给出了具体的量子纠错码的参数。     

Product Construction of Lattices as Error-Correcting Codes

This letter investigates the so-called product lattice (PL) construction. A PL is obtained from two low-dimensional lattices by means of the Kronecker product. Fundamental properties, mainly those determining the performance of a lattice as an error-correcting scheme over a bandwidth-limited channel, are derived for PLs. Due to their special structure and properties, PLs can provide an attractive family of lattice codes of good performance/complexity tradeoffs     

基于纠缠辅助码的量子模糊承诺和生物认证

本文针对经典模糊承诺体制不能有效抵抗量子算法攻击的问题,在纠缠辅助量子纠错码的基础上,结合量子哈希构造一类新的量子模糊承诺体制.利用无需自对偶约束的量子纠错码空间构建模糊承诺集产生承诺阶段所需的码字,并对其施加用于模糊证明的加噪变换,有效抵抗量子傅立叶取样攻击;提出一种量子哈希,对随机量子序列进行混淆扩散后加密,实现信息论意义上的一次一密安全.据此构建的量子模糊承诺体制可有效抵抗量子图灵机攻击.该文还给出了基于量子模糊承诺的挑战响应生物认证方案,分别对量子模糊承诺和生物认证方案在量子计算环境下的安全性作了分析,证明了其安全性和有效性.     

Error-Correcting Codes Against the Worst-Case Partial-Band Jammer

This paper provides performance analyses of a broad spectrum of error-correcting codes in an antijam communication system under worst-case partial-band noise jamming conditions. These analyses demonstrate the coding advantages available for systems operating with and without frequency diversity. Utilizing both the exact approach (where possible) and upper-bounding approaches (Chernoff and union bounds), the decoded bit error rates for typical error-correcting codes (binary andM-ary, block and convolutional) have been obtained, and these codes have been compared according to theE_{b}/N_{0}required to achieve a bit error rate of 10^-5. The best performance is achieved with the use ofM-ary signaling and optimum diversity withM-ary codes, such as Reed-Solomon block codes, dual-kconvolutional codes, convolutional orthogonal codes, or concatenated codes.     

Use of Error Correcting Codes on Memory Words for Improved Reliability

Application of error correcting coding is often employed to improve system operation and reliability. By means of suitable reliability models and simple analysis, the effect of error correcting coding of memory words on the overall reliability of the system is discussed. Introduction of error correcting facilities will generally have three significant effects on the system: 1) increased hardware, which is also subject to failures and hence tends to lower reliability; 2) the system's ability to function in the presence of a certain class of failures; and 3) quicker detection of errors, which also means an improved repair rate. To illustrate the extent to which the above three factors govern the reliability improvement due to coding, three types of systems are considered. These systems use the same basic processor and memory units but differ in their structure and complexity. Other factors besides the three above which control the reliability improvement due to coding are the system structure and the relative sizes of processor and memory hardware.     

On the Performance of Short Forward Error-Correcting Codes

This letter investigates the performance of short forward error-correcting (FEC) codes. Reed-Solomon (RS) codes and concatenated zigzag codes are chosen as representatives of classical algebraic codes and modern simple iteratively decodable codes, respectively. Additionally, random binary linear codes are used as a baseline reference. Our main results (demonstrated by simulations and ensemble distance spectrum analysis) are as follows: 1) Short RS codes are as good as random binary linear codes; 2) Carefully designed short low-density parity-check (LDPC) codes are almost as good as random binary linear codes; 3) Low complexity belief propagation decoders incur considerable performance loss at short coding lengths. Thus, future work could focus on developing low-complexity (near) optimal decoders for RS codes and/or LDPC codes.     

Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams

Coding in the projective space has received recently a lot of attention due to its application in network coding. Reduced row echelon form of the linear subspaces and Ferrers diagram can play a key role for solving coding problems in the projective space. In this paper, we propose a method to design error-correcting codes in the projective space. We use a multilevel approach to design our codes. First, we select a constant-weight code. Each codeword defines a skeleton of a basis for a subspace in reduced row echelon form. This skeleton contains a Ferrers diagram on which we design a rank-metric code. Each such rank-metric code is lifted to a constant-dimension code. The union of these codes is our final constant-dimension code. In particular, the codes constructed recently by Koetter and Kschischang are a subset of our codes. The rank-metric codes used for this construction form a new class of rank-metric codes. We present a decoding algorithm to the constructed codes in the projective space. The efficiency of the decoding depends on the efficiency of the decoding for the constant-weight codes and the rank-metric codes. Finally, we use puncturing on our final constant-dimension codes to obtain large codes in the projective space which are not constant-dimension.     

级联码结合交织技术的纠错性能研究

本文将格状编码调制(TCM)技术与RS纠错码相结合,研究在数字传输系统中的纠错性能与抗干扰能力,给出了数据交织与非交织条件下差错控制系统的计算机模拟结果。模拟结果表明：采用级联码与交织技术可使信道传输的误码率从10^-3降至10^-7,编码增益提高35dB。     

基于纠错编码的彩色图像双水印算法研究

提出一种基于纠错编码的彩色图像双水印算法,用于版权保护和图像篡改定位与恢复。算法在图像的红色分量的频域中嵌入鲁棒水印,在绿色分量的空域中嵌入认证水印。其中,认证水印为从三个颜色分量的DCT系数中提取的二进制编码序列。为提高认证水印的安全性和定位能力．对认证水印进行纠错编码,并利用M序列对认证水印进行加密。仿真实验表明,认证水印能够检测篡改并进行恢复,版权保护水印具有较好的鲁棒性。     

Intravascular Ultrasound Tissue Characterization with Sub-class Error-Correcting Output Codes

Intravascular ultrasound (IVUS) represents a powerful imaging technique to explore coronary vessels and to study their morphology and histologic properties. In this paper, we characterize different tissues based on radial frequency, texture-based, and combined features. To deal with the classification of multiple tissues, we require the use of robust multi-class learning techniques. In this sense, error-correcting output codes (ECOC) show to robustly combine binary classifiers to solve multi-class problems. In this context, we propose a strategy to model multi-class classification tasks using sub-classes information in the ECOC framework. The new strategy splits the classes into different sub-sets according to the applied base classifier. Complex IVUS data sets containing overlapping data are learnt by splitting the original set of classes into sub-classes, and embedding the binary problems in a problem-dependent ECOC design. The method automatically characterizes different tissues, showing performance improvements over the state-of-the-art ECOC techniques for different base classifiers. Furthermore, the combination of RF and texture-based features also shows improvements over the state-of-the-art approaches.