Concatenated codes with fixed inner code and random outer code
نویسندگان
چکیده
منابع مشابه
List Decodability of Random Linear Concatenated Codes
Ñ . These results are shown by choosing the code at random. However, as we saw in Chapter 4 the explicit constructions of codes over finite alphabets are nowhere close to achieving list-decoding capacity. The linear codes in Chapter 4 are based on code concatenation. A natural question to ask is whether linear codes based on code concatenation can get us to list-decoding capacity for fixed al...
متن کاملOn interleaved, differentially encoded convolutional codes
We study a serially interleaved concatenated code construction, where the outer code is a standard convolutional code, and the inner code is a recursive convolutional code of rate 1. Focus is put on the ubiquitous inner differential encoder (used in particular to resolve phase ambiguities), double differential encoder (used to resolve both phase and frequency ambiguities), and another rate 1 re...
متن کاملGuaranteed error correction rate for a simple concatenated coding scheme with single-trial decoding
We consider a concatenated coding scheme using a single inner code, a single outer code, and a fixed single-trial decoding strategy that maximizes the number of errors guaranteed to be corrected in a concatenated codeword. For this scheme, we investigate whether maximizing the guaranteed error correction rate, i.e., the number of correctable errors per transmitted symbol, necessitates pushing t...
متن کاملHybrid Concatenated Codes and Iterative Decoding
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...
متن کاملInner Code Rate Selection for a Concatenated Coding
| Concatenated codes have long been used as a practical means of combating errors on very noisy channels. In this paper we investigate the performance of concatenated systems that employ inner convolutional codes with outer Reed-Solomon codes. We determine upper and lower bounds of the optimal inner code rate for a selected overall code rate on a binary symmetric channel .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 47 شماره
صفحات -
تاریخ انتشار 2001