Abstract
Minimal codes are a special type of linear codes, which have nice applications in secret sharing and secure two-party computation. How to construct new infinite family of minimal codes has been a hot topic in coding theory and cryptography. In this paper, by employing exponential sums, we study the Lee-weight distributions of several classes of linear codes from defining sets over the finite chain ring Fp+uFp and determine exactly the complete weight enumerator of their Gray images under the Gray map. Furthermore, we prove that the Gray images of these linear codes are new infinite families of minimal five-weight linear codes with wminwmax<p−1p.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
