arXiv math/02110402002-11-04math.RAcs.ITmath.COmath.IT

On cyclic convolutional codes

H. Gluesing-Luerssen, W. Schmale

备注：: 50 pages

英文摘要：

We investigate the notion of cyclicity for convolutional codes as it has been introduced by Piret and Roos in the seventies. Codes of this type are described as submodules of the module of all vector polynomials in one variable with some additional generalized cyclic structure but also as specific left ideals in a skew polynomial ring. Extending a result of Piret, we show in a purely algebraic setting that these ideals are always principal. This leads to the notion of a generator polynomial just like for cyclic block codes. Similarly a control polynomial can be introduced by considering the right annihilator ideal. An algorithmic procedure is developed which produces unique reduced generator and control polynomials. We also show how basic code properties and a minimal generator matrix can be read off from these objects. A close link between polynomial and vector description of the codes is provided by certain generalized circulant matrices.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

On the Parameters of Convolutional Codes with Cyclic Structure

In this paper convolutional codes with cyclic structure will be investigated. These codes can be understood as left principal ideals in a suitable skew-polynomial ring. It has been shown in [3] that only certain combinations of the parameters (field size, length, dimension, and Forney indices) can occur for cyclic codes. We will investigate whether all these combinations can indeed be realized by a suitable cyclic code and, if so, how to construct such a code. A complete characterization and construction will be given for minimal cyclic codes. It is derived from a detailed investigation of the…

2003-12-03cs.ITmath.COmath.IT

On doubly-cyclic convolutional codes

Cyclicity of a convolutional code (CC) is relying on a nontrivial automorphism of the algebra F[x]/(x^n-1), where F is a finite field. If this automorphism itself has certain specific cyclicity properties one is lead to the class of doubly-cyclic CC's. Within this large class Reed-Solomon and BCH convolutional codes can be defined. After constructing doubly-cyclic CC's, basic properties are derived on the basis of which distance properties of Reed-Solomon convolutional codes are investigated.This shows that some of them are optimal or near optimal with respect to distance and performance.

2004-10-13cs.ITmath.ITmath.RA

A Matrix Ring Description for Cyclic Convolutional Codes

In this paper, we study convolutional codes with a specific cyclic structure. By definition, these codes are left ideals in a certain skew polynomial ring. Using that the skew polynomial ring is isomorphic to a matrix ring we can describe the algebraic parameters of the codes in a more accessible way. We show that the existence of such codes with given algebraic parameters can be reduced to the solvability of a modified rook problem. It is our strong belief that the rook problem is always solvable, and we present solutions in particular cases.

2007-08-09cs.ITmath.ITmath.RA

斜Laurent级数与一般循环卷积码

Skew Laurent Series and General Cyclic Convolutional Codes

本文研究了斜Laurent级数在构造一般循环卷积码中的作用，并探讨了如何处理斜导出带来的困难。

2026-01-10math.RA

A class of one-dimensional MDS convolutional codes

A class of one-dimensional convolutional codes will be presented. They are all MDS codes, i. e., have the largest distance among all one-dimensional codes of the same length n and overall constraint length delta. Furthermore, their extended row distances are computed, and they increase with slope n-delta. In certain cases of the algebraic parameters, we will also derive parity check matrices of Vandermonde type for these codes. Finally, cyclicity in the convolutional sense will be discussed for our class of codes. It will turn out that they are cyclic if and only if the field element used in t…

2004-12-17cs.ITmath.ITmath.RA

On skew cyclic codes over $F_q+vF_q+v^2F_q$

In the present paper, we study skew cyclic codes over the ring $F_{q}+vF_{q}+v^2F_{q}$, where $v^3=v,~q=p^m$ and $p$ is an odd prime. We investigate the structural properties of skew cyclic codes over $F_{q}+vF_{q}+v^2F_{q}$ using decomposition method. By defining a Gray map from $F_{q}+vF_{q}+v^2F_{q}$ to $F_{q}^3$, it has been proved that the Gray image of a skew cyclic code of length $n$ over $F_{q}+vF_{q}+v^2F_{q}$ is a skew $3$-quasi cyclic code of length $3n$ over $F_{q}$. Further, it is shown that the skew cyclic codes over $F_{q}+vF_{q}+v^2F_{q}$ are principally generated. Finally, the…

2015-04-16cs.ITmath.ITmath.RA

更多相关论文收起更多论文

Cyclic codes over $M_2(\F_2)$

The ring in the title is the first non commutative ring to have been used as alphabet for block codes. The original motivation was the construction of some quaternionic modular lattices from codes. The new application is the construction of space time codes obtained by concatenation from the Golden code. In this article, we derive structure theorems for cyclic codes over that ring, and use them to characterize the lengths where self dual cyclic codes exist. These codes in turn give rise to formally self dual quaternary codes.

2012-01-31cs.ITmath.ITmath.RA

Distance bounds for convolutional codes and some optimal codes

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 t…

2003-05-09cs.ITmath.ITmath.OC

Hermitian Self-Dual Cyclic Codes of Length $p^a$ over $GR(p^2,s)$

In this paper, we study cyclic codes over the Galois ring ${\rm GR}({p^2},s)$. The main result is the characterization and enumeration of Hermitian self-dual cyclic codes of length $p^a$ over ${\rm GR}({p^2},s)$. Combining with some known results and the standard Discrete Fourier Transform decomposition, we arrive at the characterization and enumeration of Euclidean self-dual cyclic codes of any length over ${\rm GR}({p^2},s)$. Some corrections to results on Euclidean self-dual cyclic codes of even length over $\mathbb{Z}_4$ in Discrete Appl. Math. 128, (2003), 27 and Des. Codes Cryptogr. 39, …

2014-01-26cs.ITmath.ITmath.RA

On the Lattice of Cyclic Linear Codes Over Finite Chain Rings

Let $\texttt{R}$ be a commutative finite chain ring of invariants $(q,s).$ In this paper, the trace representation of any free cyclic $\texttt{R}$-linear code of length $\ell,$ is presented, via the $q$-cyclotomic cosets modulo $\ell,$ when $\texttt{gcd}(\ell, q) = 1.$ The lattice $\left(\texttt{Cy}(\texttt{R},\ell), +, \cap\right)$ of cyclic $\texttt{R}$-linear codes of length $\ell,$ is investigated. A lower bound on the Hamming distance of cyclic $\texttt{R}$-linear codes of length $\ell,$ is established. When $q$ is even, a family of MDS and self-orthogonal $\texttt{R}$-linear cyclic codes…

2017-01-30cs.ITmath.ITmath.RA

The Gray Image of Codes over Finite Chain Rings

The results of J. F. Qiann et al. [4] on $(1-γ)$-cyclic codes over finite chain rings of nilpotency index 2 are extended to $(1-γ^e)$-cyclic codes over finite chain rings of arbitrary nilpotency index $e+1$. The Gray map is introduced for this type of rings. We prove that the Gray image of a linear $(1 - γ^{e})$-cyclic code over a finite chain ring is a distance-invariant quasi-cyclic code over its residue field. When the length of codes and the characteristic of a ring are relatively prime, the Gray images of a linear cyclic code and a linear $(1+γ^e)$-cyclic code are permutatively to quasi-c…

2009-10-02cs.ITmath.ITmath.RA

Some results about double cyclic codes over $\mathbb{F}_{q}+v\mathbb{F}_{q}+v^2\mathbb{F}_{q}$

Let $\mathbb{F}_{q}$ be the finite field with $q$ elements. This paper mainly researches the polynomial representation of double cyclic codes over $\mathbb{F}_{q}+v\mathbb{F}_{q}+v^2\mathbb{F}_{q}$ with $v^3=v$. Firstly, we give the generating polynomials of these double cyclic codes. Secondly, we show the generating matrices of them. Meanwhile, we get quantitative information related to them by the matrix forms. Finally, we investigate the relationship between the generators of double cyclic codes and their duals.

2021-03-10cs.ITmath.ITmath.RA

On Quantum Codes Obtained From Cyclic Codes Over F_2+vF_2+v^2F_2

A new Gray map which is both an isometry and a weight preserving map from R=F_2+vF_2+v^2F_2 to (F_2)^3 is defined. A construction for quantum error correcting codes from cyclic codes over finite ring R=F_2+vF_2+v^2F_2, v^3=v is given. The parameters of quantum codes which are obtained from cyclic codes over R are determined.

2014-06-19cs.ITmath.ITmath.RA

Skew-cyclic codes

We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the obtained codes share most properties of cyclic codes. Since there are much more skew-cyclic codes, this new class of codes allows to systematically search for codes with good properties. We give many examples of codes which improve the previously best known linear codes.

2006-04-27math.RA

The condition for a cyclic code over Z4 of odd length to have a complementary dual

We show that a necessary and sufficient condition for a cyclic code C over Z4 of odd length to be an LCD code is that C=(f(x)) where f is a self-reciprocal polynomial in Z4[X].

2019-05-29math.RA

有限链环上长度为 $n$ 的循环码

Cyclic codes of length $n$ over finite chain rings

本文通过群代数方法研究有限链环上长度为奇数 $n$ 的循环码，确定本原幂等元并计算码字数量与最小重量。

2025-09-19math.RA