Linear codes with few weights over $\mathbb{F}_{p}+u\mathbb{F}_{p}$
Pavan Kumar, Noor Mohammad Khan

TL;DR
This paper constructs linear codes over a specific ring extension of finite fields using trace functions and determines their weight distributions through symplectic-weight analysis of Gray images.
Contribution
It introduces a method to construct linear codes over _{p}+u_{p} using trace functions and analyzes their weight distributions.
Findings
Derived explicit weight distributions for the constructed codes.
Established connections between symplectic weights and Gray images.
Provided new classes of codes with few weights.
Abstract
For any positive integer and an odd prime ; let , where , be a ring extension of the ring In this paper, we construct linear codes over by using trace function defined on and determine their Hamming weight distributions by employing symplectic-weight distributions of their Gray images.
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 · Cooperative Communication and Network Coding
