On cyclic convolutional codes

DOI10.1023/B:ACAP.0000027534.61242.09MaRDI QIDQ1876567zbMATH OpenFDO

Authors Heide Gluesing-Luerssen, Wiland Schmale

Publication date 20 August 2004

Published in Acta Applicandae Mathematicae (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0305135

zbMATH Keywords

circulant matricescyclic codescyclic convolutional codesgenerator polynomialparity-check polynomialskew polynomial ring

Mathematics Subject Classification ID

Convolutional codes (94B10)

Abstract: After a discussion of the Griesmer and Heller bound for the distance of a convolutional code we present several codes with various parameters, over various fields, and meeting the given distance bounds. Moreover, the Griesmer bound is used for deriving a lower bound for the field size of an MDS convolutional code and examples are presented showing that, in most cases, the lower bound is tight. Most of the examples in this paper are cyclic convolutional codes in a generalized sense as it has been introduced in the seventies. A brief introduction to this promising type of cyclicity is given at the end of the paper in order to make the examples more transparent.

Review text

The mathematical theory of convolutional codes is not nearly as developed as that of block codes. This gap is even larger when it comes to the notion of cyclicity. The present paper is a step to minimize this gap by initiating the definition of \(\sigma\)-cyclicity for convolutional codes. In this effort, Piret's results appear to serve as a good basis for a theory of \(\sigma\)-cyclic convolutional codes. The authors construct the (generalized) Piret algebra \(A[z;\sigma]\) and develop the representation of \(\sigma\)-cyclic convolutional codes as left ideals in \(A[z;\sigma]\). Further, the authors give an algebraic and extended version of Piret's main result, which states that \(\sigma\)-cyclic convolutional codes are left principal ideals in \(A[z;\sigma]\). Thereafter the authors investigate as to what extent a generator of a left ideal in \(A[z;\sigma]\) is unique and show how this unique generator can be computed by means of a finite algorithmic procedure. A parity-check polynomial is obtained via (right) annihilator ideals in the Piret algebra. These results are derived by combining the techniques for circulant matrices with the algebraic methods. The present work is certainly a breakthrough in the theory of convolutional codes

Recommendations

• A matrix ring description for cyclic convolutional codes
• ON THE ALGEBRAIC PARAMETERS OF CONVOLUTIONAL CODES WITH CYCLIC STRUCTURE
• On doubly-cyclic convolutional codes
• Cyclic convolutional codes over separable extensions
• Convolutional cylinder-type block-circulant cycle codes

Cited in

(39)

• Rough ideals under relations associated to fuzzy ideals
• On duals and parity-checks of convolutional codes over \(\mathbb{Z}_{p^r}\)
• Message encoding and retrieval for spread and cyclic orbit codes
• Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance
• Prime fuzzy ideals over noncommutative rings.
• Convolutional codes: techniques of construction
• Peterson-Gorenstein-Zierler algorithm for differential convolutional codes
• Cyclic distances of idempotent convolutional codes
• Convolutional codes with additional algebraic structure
• On doubly-cyclic convolutional codes
• On negacyclic MDS-convolutional codes
• Convolutional codes with maximum distance profile
• Convolutional codes with a matrix-algebra word-ambient
• Computing separability elements for the sentence-ambient algebra of split ideal codes
• An isomorphism test for modules over a non-commutative PID. Applications to similarity of Ore polynomials.
• A New Perspective of Cyclicity in Convolutional Codes
• scientific article; zbMATH DE number 3865152 (Why is no real title available?)
• ON THE ALGEBRAIC PARAMETERS OF CONVOLUTIONAL CODES WITH CYCLIC STRUCTURE
• Cyclic convolutional codes over separable extensions
• Quasi-cyclic unit memory convolutional codes
• LDPC Block and Convolutional Codes Based on Circulant Matrices
• scientific article; zbMATH DE number 3700718 (Why is no real title available?)
• Nonbinary convolutional codes derived from group character codes
• On a conjectured ideal autocorrelation sequence and a related triple-error correcting cyclic code
• A circulant approach to skew-constacyclic codes
• Cyclic and Convolutional Codes With Locality
• Peterson-Gorenstein-Zierler algorithm for skew RS codes
• Dual skew codes from annihilators: transpose Hamming ring extensions
• Basic module theory over non-commutative rings with computational aspects of operator algebras
• Convolutional cylinder-type block-circulant cycle codes
• A CLASS OF ONE-DIMENSIONAL MDS CONVOLUTIONAL CODES
• System level reliability in convolution computations
• Minimal encoders of convolutional codes with general cyclic structures
• Skew Laurent series and general cyclic convolutional codes
• A polynomial-based key distribution approach for wireless sensor networks
• Response compaction for system-on-a-chip based on advanced convolutional codes
• On superregular matrices and MDP convolutional codes
• A matrix ring description for cyclic convolutional codes
• Classification of convolutional codes

This page was built for publication: On cyclic convolutional codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1876567)