1983•IEEE Transactions on Information TheoryRequires access

The existence of binary linear concatenated codes with Reed - Solomon outer codes which asymptotically meet the Gilbert- Varshamov bound

C. Thommesen

Abstract

Binary linear concatenated codes with Reed-Solomon codes as the outer code and varying nonsystematic inner codes are investigated. It is shown that codes exist in this class which asymptotically meet the Gilbert-Varshamov bound.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 40 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: Concatenated error correction code, Linear code, Reed–Muller code, Reed–Solomon error correction, Expander code, Block code, Luby transform code, Tornado code

Back to paper search Browse research topics Original source

The existence of binary linear concatenated codes with Reed - Solomon outer codes which asymptotically meet the Gilbert- Varshamov bound — Research Paper | ScholarLens