A parallel concatenated coding scheme consists of two simple constituent systematic encoders linked by an interleaver. The input bits to the rst encoder are scrambled by the interleaver before entering the second encoder. The codeword of the parallel concatenated code consists of the input bits to the rst encoder followed by the parity check bits of both encoders. This construction can be gener...

A hybrid concatenated code with two interleavers is the parallel concatenation of an encoder, which accepts the permuted version of the information sequence as its input, with a serially concatenated code, which accepts the unpermuted information sequence. The serially concatenated code consists of an outer encoder, an interleaver, and an inner encoder. An upper bound to the average maximum-lik...

.’ parallel concatenated convolutional coding scheme consists of two constituent systematic convolutional encoders linked by an interleaver. The information bits at the input of the first encoder are scrambled by the interleaver before entering the second encoder. The codewords of the parallel concatenated code consist of the information bits followed by the parity check bits of both encoders. ...

In this paper we consider convolutional and block encoding schemes which are variations of woven codes with outer warp. We propose methods to evaluate the distance characteristics of the considered codes on the basis of the active distances of the component codes. With this analytical bounding technique, we derived lower bounds on the minimum (or free) distance of woven convolutional codes, wov...

The performance of data hiding techniques in still images may be greatly improved by means of coding. In previous approaches repetition coding was firstly used to obtain N identical Gaussian channels over which block and convolutional coding were used. But knowing that repetition coding can be improved we may turn our attention to coding forwardly at the sample level. Bounds for both hard and s...

Turbo codes with long frame lengths are usually constructed using a randomly chosen interleaver. Statistically, this guarantees excellent bit-error rate (BER) performance but also generates a certain number of low weight codewords, resulting in the appearance of an error floor in the BER curve. Several methods, including using an outer code, have been proposed to improve the error floor region ...

Code bad smells represent symptoms of poor implementation choices. Previous studies found that these smells make source code more difficult to maintain, possibly also increasing its fault-proneness. There are plethora of approaches that identify bad smells based on code analysis techniques. We propose, in this paper, to consider code-smells correction as a distributed problem. Different techniq...

A serially concatenated code with an interleaver consists of the cascade of an outer code, an interleaver permuting the outer codewords’ bits, and an inner code whose input words are the permuted outer codewords. The construction can be generalized to h cascaded codes separated by h − 1 interleavers. We obtain upper bounds to the average maximum-likelihood bit-error probability of serially conc...

Recently a framework for assisted quantum error correction was proposed in which a specific type of error is allowed to occur on auxiliary qubits, which is in contrast to standard entanglement assistance that requires noiseless auxiliary qubits. However, while the framework maintains the ability to import any binary or quaternary linear code without sacrificing active error correction power, it...

3 Quantum Error Correction 13 3.1 Trivial Two-Qubit Example . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 3.2 Quantum Repetition Code . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 3.3 Quantum Code for a Cyclic System . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 3.4 Three Quantum Spin-Half Particles . . . . . . . . . . . . . . . ....