2002Unpublished venueRequires access

The trellis complexity of convolutional codes

Robert J. McEliece, Wei Lin

Open publisher page 11 citations

Abstract

We develop a theory of minimal trellises for convolutional codes, and find that the "standard" trellis need not be the minimal trellis.

About this research paper

What this paper is about

We develop a theory of minimal trellises for convolutional codes, and find that the "standard" trellis need not be the minimal trellis.

Why it matters

OpenAlex reports 11 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

We develop a theory of minimal trellises for convolutional codes, and find that the "standard" trellis need not be the minimal trellis.

Key concepts: Trellis (graph), Convolutional code, Space–time trellis code, Computer science, Algorithm, Trellis quantization, Block code, Theoretical computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
The trellis complexity of convolutional codes — Research Paper | ScholarLens