Some results of linear codes over the ring $\mathbb{Z}_4+u\mathbb{Z}_4+v\mathbb{Z}_4+uv\mathbb{Z}_4$
Ping Li, Xuemei Guo, Shixin Zhu

TL;DR
This paper explores the structure and properties of linear codes over a specific ring constructed from $\
Contribution
It introduces a Gray map for codes over the ring, studies cyclic codes, and derives MacWilliams identities and properties of MDS codes over this ring.
Findings
Gray map preserves distance between codes over R and Z4.
Cyclic codes over R map to linear codes over Z4.
Properties of MDS codes over R are discussed.
Abstract
In this paper, we mainly study the theory of linear codes over the ring . By the Chinese Remainder Theorem, we have is isomorphic to the direct sum of four rings . We define a Gray map from to , which is a distance preserving map. The Gray image of a cyclic code over is a linear code over . Furthermore, we study the MacWilliams identities of linear codes over and give the the generator polynomials of cyclic codes over . Finally, we discuss some properties of MDS codes over .
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 · Finite Group Theory Research · Cooperative Communication and Network Coding
