(Sigma-Delta) Codes
Preprint
Abstract
In this paper we introduce the notion of cyclic ($f(t),\sigma,\delta$)-codes for $f(t)\in \Ore$. These codes generalize the $\theta$-codes as introduced by D. Boucher, F. Ulmer, W. Geiselmann \cite{BGU}. We construct generic and control matrices for these codes. As a particular case the ($\si,\de$)-$W$-code associated to a Wedderburn polynomial are defined and we show that their control matrices are given by generalized Vandermonde matrices. All the Wedderburn polynomials of $\mathbb F_q[t;\theta]$ are described and their control matrices are presented. A key role will be played by the pseudo-linear transformations.
Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Convolutional codes with additional algebraic structureJournal of Pure and Applied Algebra, 2013
- NONCOMMUTATIVE POLYNOMIAL MAPSJournal of Algebra and Its Applications, 2012
- Linear codes using skew polynomials with automorphisms and derivationsDesigns, Codes and Cryptography, 2012
- Code equivalence characterizes finite Frobenius ringsProceedings of the American Mathematical Society, 2007
- Wedderburn polynomials over division rings, IJournal of Pure and Applied Algebra, 2004
- Factoring in Skew-polynomial Rings over Finite FieldsJournal of Symbolic Computation, 1998
- Pseudolinear transformations and evaluation in Ore extensionsBulletin of the Belgian Mathematical Society - Simon Stevin, 1995
- Derivations in Simple RingsProceedings of the London Mathematical Society, 1957