
TL;DR
This paper introduces cyclic ($f(t),\sigma,\delta$)-codes in Ore polynomial rings, generalizing previous $ heta$-codes, and provides their construction, properties, and matrix representations, including special cases related to Wedderburn polynomials.
Contribution
It generalizes $ heta$-codes to cyclic ($f(t),\sigma,\delta$)-codes in Ore rings and characterizes their control matrices, especially for Wedderburn polynomials.
Findings
Control matrices are given by generalized Vandermonde matrices.
All Wedderburn polynomials in $ ext{F}_q[t; heta]$ are characterized.
Pseudo-linear transformations are key to the code structure.
Abstract
In this paper we introduce the notion of cyclic ()-codes for . These codes generalize the -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 ()--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 are described and their control matrices are presented. A key role will be played by the pseudo-linear transformations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Cellular Automata and Applications
