ON CLASSICAL BCH CODES AND QUANTUM BCH CODES

It is a regular way of constructing quantum error-correcting codes via codes with self-orthogonal property, and whether a classical Bose-Chaudhuri-Hocquenghem (BCH) code is self-orthogonal can be determined by its designed distance. In this paper, we give the sufficient and necessary condition for arbitrary classical BCH codes with self-orthogonal property through algorithms. We also give a better upper bound of the designed distance of a classical narrow-sense BCH code which contains its Euclidean dual. Besides these, we also give one algorithm to compute the dimension of these codes. The complexity of all algorithms is analyzed. Then the results can be applied to construct a series of quantum BCH codes via the famous CSS constructions.

Quantum BCH Codes Based on Spectral Techniques

When the time variable in quantum signal processing is discrete, the Fourier transform exists on the vector space of n-tuples over the Galois field F2, which plays an important role in the investigation of quantum signals. By using Fourier transforms, the idea of quantum coding theory can be described in a setting that is much different from that seen that far. Quantum BCH codes can be defined as codes whose quantum states have certain specified consecutive spectral components equal to zero and the error-correcting ability is also described by the number of the consecutive zeros. Moreover, the decoding of quantum codes can be described spectrally with more efficiency.

Constructions of new families of nonbinary asymmetric quantum BCH codes and subsystem BCH codes

Two code constructions generating new families of good nonbinary asymmetric quantum BCH codes and good nonbinary subsystem BCH codes are presented in this paper.The first one is derived from q-ary Steane's enlargement of CSS codes applied to nonnarrow-sense BCH codes.The second one is derived from the method of defining sets of classical cyclic codes.The asymmetric quantum BCH codes and subsystem BCH codes here have better parameters than the ones available in the literature.

On the complete weight distributions of quantum error-correcting codes

In a recent paper, Hu et al. defined the complete weight distributions of quantum codes and proved the Mac Williams identities, and as applications they showed how such weight distributions may be used to obtain the singleton-type and hamming-type bounds for asymmetric quantum codes. In this paper we extend their study much further and obtain several new results concerning the complete weight distributions of quantum codes and applications. In particular, we provide a new proof of the Mac Williams identities of the complete weight distributions of quantum codes. We obtain new information about the weight distributions of quantum MDS codes and the double weight distribution of asymmetric quantum MDS codes. We get new identities involving the complete weight distributions of two different quantum codes. We estimate the complete weight distributions of quantum codes under special conditions and show that quantum BCH codes by the Hermitian construction from primitive, narrow-sense BCH codes satisfy these conditions and hence these estimate applies.

BILINEAR FORMS AND LINEAR CODES

Abraham Lempel et al made a connection between linear codes and systems of bilinear forms over finite fields. In this correspondence, a new simple proof of a theorem in [1] is presented; in addition, the encoding process and the decoding procedure of RS codes are simplified via circulant matrices. Finally, the results show that the correspondence between bilinear forms and linear codes is not unique.

On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods

The evaluation of the minimum distance of linear block codes remains an open problem in coding theory, and it is not easy to determine its true value by classical methods, for this reason the problem has been solved in the literature with heuristic techniques such as genetic algorithms and local search algorithms. In this paper we propose two approaches to attack the hardness of this problem. The first approach is based on genetic algorithms and it yield to good results comparing to another work based also on genetic algorithms. The second approach is based on a new randomized algorithm which we call 'Multiple Impulse Method (MIM)', where the principle is to search codewords locally around the all-zero codeword perturbed by a minimum level of noise, anticipating that the resultant nearest nonzero codewords will most likely contain the minimum Hamming-weight codeword whose Hamming weight is equal to the minimum distance of the linear code.

Decoding of QOSTBC Concatenates BCH Code Based on Parallel Interference Cancellation

It has been shown that quasi orthogonal space time block code (QOSTBC) can achieve high transmission rate with partial diversity. In this paper, a QOSTBC concatenating Bose-Chaudhuri-Hocquenghem (BCH) code structure is presented. At the receiver, pairwise detection and error correction are first implemented. The decoded data are regrouped. Parallel interference cancellation (PIC) and dual orthogonal space time block code (OSTBC) decoding are deployed to the regrouped data. The pure concatenated scheme is shown to have higher diversity order and better error performance at high signal-to-noise ratio (SNR) scenario than both QOSTBC and OSTBC schemes. The PIC and dual OSTBC decoding algorithm can further obtain approximate 1.2 dB gains than the pure concatenated scheme at 10-6 bit error probability.

Generalized sparse codes for non-Gaussian channels:Code design,algorithms,and applications

In this paper,generalized sparse(GS)codes are proposed to support reliable and efficient transmission over non-Gaussian channels.Specifically,by expanding the single-parity check(SPC)code constraints with powerful algebraic codes,GS codes generalize conventional sparse codes with enhanced error-correcting capability,as well as better code design flexibility by covering a wide range of block-lengths and coding rates with reduced encoding/decoding complexity.Moreover,by introducing a universal communication channel model,a general framework for performance analysis and code design of GS codes is formulated,by which the coding parameters can be optimized for different target channel conditions.Finally,example codes are constructed for several critical application scenarios with non-Gaussian channels.Numerical simulations are performed to demonstrate the superiority of the proposed GS coding scheme to traditional channel coding schemes.

On deep holes of standard Reed-Solomon codes

Determining deep holes is an important open problem in decoding Reed-Solomon codes. It is well known that the received word is trivially a deep hole if the degree of its Lagrange interpolation polynomial equals the dimension of the Reed-Solomon code. For the standard Reed-Solomon codes [p-1, k]p with p a prime, Cheng and Murray conjectured in 2007 that there is no other deep holes except the trivial ones. In this paper, we show that this conjecture is not true. In fact, we find a new class of deep holes for standard Reed-Solomon codes [q-1, k]q with q a power of the prime p. Let q≥4 and 2≤k≤q-2. We show that the received word u is a deep hole if its Lagrange interpolation polynomial is the sum of monomial of degree q-2 and a polynomial of degree at most k-1. So there are at least 2(q-1)qk deep holes if k q-3.

A BCH error correction scheme applied to FPGA with embedded memory

Given the potential for bit flipping of data on a memory medium,a high-speed parallel Bose-Chaudhuri-Hocquenghem(BCH)error correction scheme with modular characteristics,combining logic implementation and a look-up table,is proposed.It is suitable for data error correction on a modern field programmable gate array full with on-chip embedded memories.We elaborate on the optimization method for each part of the system and analyze the realization process of this scheme in the case of the BCH code with an information bit length of 1024 bits and a code length of 1068 bits that corrects the 4-bit error.

Generalized Low-Density Parity-Check Coding Scheme with Partial-Band Jamming

In this study, a class of Generalized Low-Density Parity-Check （GLDPC） codes is designed for data transmission over a Partial-Band Jamming （PBJ） environment. The GLDPC codes are constructed by replacing parity-check code constraints with those of nonsystematic Bose-Chaudhuri-Hocquenghem （BCH）, referred to as Low-Density Parity-Check （LDPC）-BCH codes. The rate of an LDPC-BCH code is adjusted by selecting the transmission length of the nonsystematic BCH code, and a low-complexity decoding algorithm based on message- passing is presented that employs A Posteriori Probability （APP） fast BCH transform for decoding the BCH check nodes at each decoding iteration. Simulation results show that the LDPC-BCH codes with a code rate of 1/8.5 have a bit error rate performance of 1 x10-8 at signal-noise-ratios of -6.97 dB, -4.63 dB, and 2.48 dB when the fractions of the band jammed are 30%, 50%, and 70%, respectively.