$(1-2u^k)$-constacyclic codes over $\mathbb{F}_p+u\mathbb{F}_p+u^2\mathbb{F}_+u^{3}\mathbb{F}_{p}+\dots+u^{k}\mathbb{F}_{p}$
Zahid Raza, Amrina Rana

TL;DR
This paper investigates a class of constacyclic codes over a specific finite ring, analyzing their structure, generator polynomials, and properties using decomposition techniques.
Contribution
It introduces the study of $(1-2u^k)$-constacyclic codes over a complex ring structure and explores their algebraic properties and generator polynomials.
Findings
Structural properties of the codes are characterized.
Generator polynomials are explicitly described.
Decomposition theorem is applied to analyze the codes.
Abstract
Let be a finite field and be an indeterminate. This article studies -constacyclic codes over the ring where . We illustrate the generator polynomials and investigate the structural properties of these codes via decomposition theorem.
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
