One-Sided Repeated-Root Two-Dimensional Cyclic and Constacyclic Codes
Marziyeh Beygi Khormaei, Ashkan Nikseresht, Shohreh Namazi

TL;DR
This paper explores the structure, duality, and asymptotic properties of one-sided repeated-root two-dimensional cyclic and constacyclic codes over finite fields, correcting previous inaccuracies and establishing new conditions.
Contribution
It provides generator matrices, polynomials, duality conditions, and links between asymptotic families of these codes, improving understanding and correcting prior results.
Findings
Derived generator matrices and polynomials for these codes.
Identified conditions for self-duality.
Established the existence of asymptotically good code families.
Abstract
In this paper, we study some repeated-root two-dimensional cyclic and constacyclic codes over a finite field . We obtain the generator matrices and generator polynomials of these codes and their duals. We also investigate when such codes are self-dual. Moreover, we prove that if there exists an asymptotically good family of one-sided repeated-root two-dimensional cyclic or constacyclic codes, then there exists an asymptotically good family of simple root two-dimensional cyclic or constacyclic codes with parameters at least as good as the first family. Furthermore, we show that several of the main results of the papers Rajabi and Khashyarmanesh (2018) and Sepasdar and Khashyarmanesh (2016) are not accurate and find other conditions needed for them to hold.
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
