The partial response channel can be viewed as a rate-1 encoder in which the output alphabet differs from the input alphabet. In serially concatenated coding schemes, the partial response channel can serve as the inner encoder. Recent work on the application of turbo decoding techniques to partial response channels has focused on using a parallel concatenation of convolutional encoders as the ou...

— From an [n, k, d] code over GF (2s) a binary nonrecursive convolutional code of rate k/n, memory m ≤ s− 1 and free distance ≥ d is constructed. When the generator matrix of the block code is in systematic form, the attached convolutional encoder is shown to be basic, and systematic. Asymptotic estimates, for fixed m and large n and k are derived. There exist long binary convolutional codes ob...

In this thesis we investigate the worst-case performance of coded ordinary and coded generalized direct sequence spread spectrum (DSSS) systems in a communication channel corrupted by an unknown and arbitrary interfering signal of bounded power. We consider convolutional codes with Viterbi decoding in order to compare the performance of coded ordinary and coded generalized DSSS systems. For the...

The paper addresses minimality of encoders for basic convolutional codes over Zpr by using a recently developed concept of row reducedness for polynomial matrices over Zpr . It is known in the literature that the McMillan degree of a basic encoder is an upper bound for the minimum number of trellis states, but a general expression is missing. This open problem is solved in this paper. An expand...

This paper aims to verify the performance of a serially concatenated code proposed by Stephan ten Brink [1]. The code combines an outer rate one-half repetition code with an inner rate one convolutional code, separated by a permuter. The code is claimed to reach a bit error rate under 10 by 0.28 dB.

D. J. Costello, Jr., “Free distance bounds for convolutional codes,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 356-365, May 1974. M. Mooser, “Some periodic convolutional codes better than any fixed Code,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 75G751, Sept. 1983. J. L. Massey, “Error bounds for tree codes, trellis codes, and convolutional codes with encoding, and decoding procedures,” CI...

In this paper we use some classical ideas from linear systems theory to analyse convolutional codes. In particular, we exploit input-state-output representations of periodic linear systems to study periodically time-varying convolutional codes. In this preliminary work we focus on the column distance of these codes and derive explicit necessary and sufficient conditions for an (n, 2, 1) periodi...