The use of error-correcting codes for tight control of the peak-to-mean envelope power ratio (PMEPR) in orthogonal frequency-division multiplexing (OFDM) transmission is considered in this correspondence. By generalizing a result by Paterson, it is shown that each q-phase (q is even) sequence of length 2 lies in a complementary set of size 2, where k is a nonnegative integer that can be easily ...

In this paper we utilize both the implicit residual source correlation and the explicit redundancy from a forward-error-correction (FEC) scheme for the error protection of packetized variable-length encoded source indices. The implicit source correlation is exploited in a novel symbol-based soft-input a-posteriori probability (APP) decoder, which leads to an optimal decoding process in combinat...

The entanglement-assisted stabilizer formalism provides a useful framework for constructing quantum error-correcting codes (QECC), which can transform arbitrary classical linear codes into entanglement-assisted quantum error correcting codes (EAQECCs) by using pre-shared entanglement between the sender and the receiver. In this paper, we construct five classes of entanglement-assisted quantum M...

Our purpose here is to show how it is possible to recover the structure of a randomly permuted concatenated code, and how to use this information for decoding. This result prohibits the use of rst order concatenated codes in public-key cryp-tosystems based on error-correcting codes. R esum e Nous montrons ici comment il est possible de reconstituer la structure d'un code concat en e permut e al...

Construction X is known from the theory of classical error control codes. We present a variant of this construction that produces stabilizer quantum error control codes from arbitrary linear codes. Our construction does not require the classical linear code that is used as an ingredient to satisfy the dual containment condition. We prove lower bounds on the minimum distance of quantum codes obt...

A new method for computing the minimum distances of linear error correcting codes is proposed and justi ed Unlike classical techniques that rely on exhaustive or partial enu meration of codewords this new method is based on the ability of the Soft In decoder to overcome Error Impulse input patterns It is shown that the maximum magnitude of the Error Impulse that can be corrected by the decoder ...

This paper mainly about the study on one of the widely used error correcting codes that is Low parity check Codes (LDPC). In this paper, the Regular LDPC code has been discussed The LDPC codes explained in this paper is about the Regular Binary LDPC codes or the Gallager. Keywords—LDPC, channel coding.

A c-secure code with -error is one of the fingerprinting codes robust against a collusion attack. The purpose of this study is to construct a new c-secure code which has a shorter code length for a largescale collusion than ever proposed. We call this code a c-secure CRT code. Furthermore, we investigate possible approaches to make this code robust against random-error addition. Two approaches ...

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.

Based on the notion of an order function we construct and determine the parameters of a class of error-correcting evaluation codes. This class includes the one-point algebraic geometry codes as well as the generalized Reed-Muller codes, and the parameters are determined without using heavy machinery from algebraic geometry.