Skew constacyclic codes over a class of finite commutative semisimple rings
Ying Zhao

TL;DR
This paper investigates skew constacyclic codes over finite commutative semisimple rings, characterizing their structure and linking them to linear codes over finite fields, leading to the construction of some optimal codes.
Contribution
It characterizes skew constacyclic codes over certain rings and introduces homomorphisms to matrix product codes, enabling the construction of optimal linear codes.
Findings
Automorphism group of the ring is determined.
Skew constacyclic codes are characterized via linear codes over finite fields.
Some optimal linear codes over finite fields are constructed.
Abstract
In this article, we study skew constacyclic codes over a class of finite commutative semisimple rings. The automorphism group of is determined, and we characterize skew constacyclic codes over ring by linear codes over finite field. We also define homomorphisms which map linear codes over to matrix product codes over some optimal linear codes over finite fields are obtained.
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 · Cooperative Communication and Network Coding · Islamic Finance and Communication
