2002Unpublished venueRequires access

Canonical representation of quasi-cyclic codes

Morteza Esmaeili, T. Aaron Gulliver, N.P. Secord

Open publisher page 1 citations

Abstract

A linear block code C of length n is called quasi-cyclic (QC) if it is invariant under a cyclic shift of L positions, T/sup L/, where L

About this research paper

What this paper is about

A linear block code C of length n is called quasi-cyclic (QC) if it is invariant under a cyclic shift of L positions, T/sup L/, where L

Why it matters

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

A linear block code C of length n is called quasi-cyclic (QC) if it is invariant under a cyclic shift of L positions, T/sup L/, where L

Key concepts: Generator matrix, Polynomial code, Cyclic code, Discrete mathematics, Mathematics, Linear code, Convolutional code, Trellis (graph)

Related papers

Back to paper searchBrowse research topicsOriginal source
Canonical representation of quasi-cyclic codes — Research Paper | ScholarLens