An MDS Code Generated from a Three-Term Exponential Sum
Article Sidebar
Main Article Content
Abstract
In this paper, I investigate the method for constructing Maximum Distance Separable (MDS) codes using exponential sums. By utilizing the properties of the trace function over finite fields, I explicitly calculate linear codes associated with certain three-term exponential sums. The parameters, weight distributions, and distance properties of these codes are analyzed in detail. Furthermore, we analyse the syndrome-decoding process for these codes.
Downloads
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
How to Cite
References
W. C. Huffman, J.L. Kim, P. Sol, Concise Encyclopedia of Coding Theory, Chapman and Hall/CRC, Boca Raton (2021). DOI: https://doi.org/10.1201/9781315147901
J. Bierbrauer, Introduction to Coding Theory, Taylor and Francis. (2018) DOI: https://doi.org/10.1201/9781482296372
Z.Heng, Q.Yue, "Evaluation of the Hamming Weights of a class of linear codes based on Gauss sums. Designs, codes, cryptography. 83, 307-326 (2017). DOI: https://doi.org/10.1007/s10623-016-0222-7
G.Jain, Z.Lin, R.Fena, "Two Weight and Three Weight Linear Codes Based on Weil Sums", Finite Fields and Their Applications. 57, 92-107 (2019). DOI: https://doi.org/10.1016/j.ff9.2019.02.001
Zhao Hu,Nian Li, Xi. Zeng, "New linear codes with few weights derived from Kloostermann sum", Finite Fields and their Application. 62,101608 (2020). DOI: https://doi.org/10.1016/j.ffa.2019.101608