Key points are not available for this paper at this time.
Abstract Linear codes with few weights hold significant practical value and find application in a wide range of systems.The construction of linear codes from functions has been a thoroughly investigated research domain in existing literature. In this paper, we study the application of cryptographic functions in coding theory, and we derive several few-weight linear codes with good parameters by employing weakly regular bent functions over the finite fields of odd characteristics. Besides, we observe that all constructed codes are minimal codes according to the Ashikhmin-Barg sufficient condition. Lastly, some proposed codes are (almost) optimal due to the Griesmer bound. MSC Classification: 94A60 , 94B05 , 11T23 , 11T71 , 68R01
Erleblebici et al. (Wed,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: