2005•Unpublished venueRequires access

Asymptotically good codes with high iterative decoding performances

Iryna Andriyanova, Jean–Pierre Tillich, J.-C. Carlach

Abstract

We investigate a new class of codes which is in some senses a hybrid between LDPC codes and turbo-codes. We show that when the parameters of this class are well chosen they have very good iterative decoding performances and at the same time a minimum distance which is typically linear in the code length

About this research paper

What this paper is about

Why it matters

OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Turbo code, Low-density parity-check code, Decoding methods, Serial concatenated convolutional codes, Concatenated error correction code, Computer science, Linear code, Code (set theory)