The astonishing performance of concatenated codes attracted many researchers and this has resulted in an explosive amount of literature since their introduction few years ago. As concatenation between codes did not actually arise from applying a pre-existing theory, most of their outstanding features remain to be explained. This paper gives some explanation of the concatenation between Reed Sol...

Abstract—In this paper, we present an error-trellis construction for tailbiting convolutional codes. A tailbiting error-trellis is characterized by the condition that the syndrome former starts and ends in the same state. We clarify the correspondence between code subtrellises in the tailbiting code-trellis and error subtrellises in the tailbiting error-trellis. Also, we present a construction ...

Löndahl and Johansson proposed last year a variant of the McEliece cryptosystem which replaces Goppa codes by convolutional codes. This modification is supposed to make structural attacks more difficult since the public generator matrix of this scheme contains large parts which are generated completely at random. They proposed two schemes of this kind, one of them consists in taking a Goppa cod...

A popular combination in modern coding system is the convolutional encoder and the Viterbi decoder [5]. With a proper design, they can jointly provide an acceptable performance with feasible decoding complexity. In such a combination, a tradeoff on the error performance and the decoding complexity resides on the choice of the code constraint length. Specifically, the probability of Viterbi deco...

Convolution encoding with Viterbi decoding is a powerful method for forward error correction. It has been widely deployed in many wireless communication systems to improve the limited capacity of the communication channels. Viterbi algorithm, is the most extensively employed decoding algorithm for convolutional codes. In this paper, we present ARM based implementation of Viterbi decoder that us...

Convolutional encoding with Viterbi decoding is a powerful method for forward error correction. It has been widely deployed in many wireless communication systems to improve the limited capacity of the communication channels. The Viterbi algorithm, which is the most extensively employed decoding algorithm for convolutional codes. In this paper, we present a field-programmable gate array impleme...

PONNALA, LALIT Algorithmic Approach for finding Convolutional Code generators for the Translation Initiation of Escherichia coli K-12. (Under the direction of Professor Donald L. Bitzer and Professor Winser E. Alexander). Using error-control coding theory, we parallel the functionality of the translation of mRNA into amino acids to the decoding of noisy parity streams that have been encoded usi...

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...

Quantum convolutional codes, like their classical counterparts, promise to offer higher error correction performance than block codes of equivalent encoding complexity, and are expected to find important applications in reliable quantum communication where a continuous stream of qubits is transmitted. Grassl and Roetteler devised an algorithm to encode a quantum convolutional code with a “pearl...

This paper addresses aspects of channel coding in orthogonal frequency-division multiplexing–code-division multiple access (OFDM-CDMA) uplink systems where each user occupies a bandwidth much larger than the information bit rate. This inherent bandwidth expansion allows the application of powerful low-rate codes under the constraint of low decoding costs. Three different coding strategies are c...