A Class of Reducible Cyclic Codes and Their Weight Distribution
Yan Liu
TL;DR
This paper introduces a family of reducible cyclic codes over GF(p) with duals having four zeros and determines their weight distribution, advancing understanding of their structure and properties.
Contribution
It presents a new class of reducible cyclic codes over GF(p) with explicitly determined weight distributions, expanding coding theory knowledge.
Findings
Weight distribution of the codes is explicitly determined.
The codes have duals with four zeros.
The codes' structure is characterized for odd prime p.
Abstract
In this paper, a family of reducible cyclic codes over GF(p) whose duals have four zeros is presented, where p is an odd prime. Furthermore, the weight distribution of these cyclic codes is determined.
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 · Cellular Automata and Applications · Cryptographic Implementations and Security