The performance of a Turbo code depends on the interleaver design. There are two major criteria that can be considered in the design of an interleaver. Distance spectrum properties of the code and the correlation of the extrinsic information with the input data are the two major criteria in designing an interleaver. This paper describes a new interleaver design based on these two criteria. Simu...

Absiruct-A linear code C over GF( q) is good for t-error-correction and error detection if P(C, t; c) I P(C, t; (q 1)/q) for all z, 0 s c I (q 1)/q, where P( C, t; c) is the probability of an undetected error after a codeword in C is transmitted over a q-ary symmetric channel with error probability c and correction is performed for ail error patterns with t or fewer errors. A sufficient conditi...

We give a new proof of Delsarte, Goethals and Mac williams theorem on minimal weight codewords of generalized Reed-Muller codes published in 1970. To prove this theorem, we consider intersection of support of minimal weight codewords with affine hyperplanes and we proceed by recursion.

We study certain projections of binary linear codes onto larger fields. These projections include the well-known projection of the extended Golay [24, 12, 8] code onto the Hexacode over GF(4) and the projection of the Reed-Muller code R(2, 5) onto the unique self-dual [8, 4, 4] code over GF(4). We give a characterization of these projections, and we construct several binary linear codes which h...

Constructions of protocol sequences for multiple-access collision channel without feedback are given. These constructions are the extensions of those described by A, GyiiriI, and Massey. If the basic code in their constructions, a Reed-Solomon code, is replaced by a BCH code then the resulting protocol sequences have the feature that, for a given sum rate, the ratio of the total user population...

In this paper, we compare the performance of several different decoding strategies for concatenated codes based on a serial concatenation of a rectangular parity-check code (RPCC) with a turbo code. These concatenated codes are referred to as RPCC+turbo codes. RPCC+turbo codes have been shown to significantly outperform turbo codes in several scenarios [1],[2]. One particularly useful applicati...

Cyclic codes are an interesting class of linear codes due to their efficient encoding and decoding algorithms as well as their theoretical importance. BCH codes form a subclass of cyclic codes and are very important in both theory and practice as they have good error-correcting capability and are widely used in communication systems, storage devices and consumer electronics. However, the dimens...

QR code(Quick Response Code) is a popular two-dimensional matrix that randomly consists of black and white square modules. While the appearance of QR codes are often visually unpleasant, it leads to the increasing demand for the aesthetic QR codes. However, it may turn out to be unreadable if changes to the modules of the QR code are inadequate. Therefore, to resolve this conflict, we propose a...

We establish the range of values of ρ, where 0 ≤ ρ ≤ m(q − 1), for which the generalized Reed-Muller code RFq (ρ,m) of length q over the field Fq of order q is spanned by its minimum-weight vectors.

In this correspondence the error exponent and the decoding complexity of binary woven convolutional codes with outer warp and with binary convolutional codes as outer and inner codes are studied. It is shown that an error probability that is exponentially decreasing with the product of the outer and inner code memories can be achieved with a nonexponentially increasing decoding complexity.