On cyclic self-orthogonal codes over Zpm
Abhay Kumar Singh, Narendra Kumar

TL;DR
This paper investigates the structure and existence conditions of cyclic self-orthogonal codes over the ring rac{p^m}{Z} and provides formulas for counting such codes of a given length.
Contribution
It derives the generator polynomial and necessary and sufficient conditions for the existence of non-trivial cyclic self-orthogonal codes over rac{p^m}{Z} and counts their number for coprime parameters.
Findings
Provides the generator polynomial for cyclic self-orthogonal codes over rac{p^m}{Z}
Establishes necessary and sufficient conditions for code existence
Counts the number of such codes of length n
Abstract
The purpose of this paper is to study the cyclic self orthogonal codes over . After providing the generator polynomial of cyclic self orthogonal codes over , we give the necessary and sufficient condition for the existence of non-trivial self orthogonal codes over . We have also provided the number of such codes of length over for any .
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
