Abstract
In this paper, few weights linear codes over the local ring \(R={\mathbb {F}}_p+u{\mathbb {F}}_p+v{\mathbb {F}}_p+uv{\mathbb {F}}_p,\) with \(u^2=v^2=0, uv=vu,\) are constructed by using the trace function defined on an extension ring of degree m of R. These trace codes have the algebraic structure of abelian codes. Their weight distributions are evaluated explicitly by means of Gauss sums over finite fields. Two different defining sets are explored. Using a linear Gray map from R to \({\mathbb {F}}_p^4,\) we obtain several families of p-ary codes from trace codes of dimension 4m. For two different defining sets: when m is even, or m is odd and \(p\equiv 3 ~(\mathrm{mod} ~4).\) Thus we obtain two family of p-ary abelian two-weight codes, which are directly related to MacDonald codes. When m is even and under some special conditions, we obtain two classes of three-weight codes. In addition, we give the minimum distance of the dual code. Finally, applications of the p-ary image codes in secret sharing schemes are presented.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Ashikhmin, A., Barg, A.: Minimal vectors in linear codes. IEEE Trans. Inf. Theory 44(5), 2010–2017 (1998)
Byrne, E., Greferath, M., Honold, T.: Ring geometries, two-weight codes, and strongly regular graphs. Des. Codes Cryptogr. 48(1), 1–16 (2008)
Calderbank, A.R., Goethals, J.M.: Three-weight codes and association schemes. Philips J. Res. 39(4), 143–152 (1984)
Calderbank, A.R., Kantor, W.M.: The geometry of two-weight codes. Bull. Lond. Math. Soc. 18(2), 97–122 (1986)
Courteau, B., Wolfmann, J.: On triple sum sets and three-weight codes. Discrete Math. 50(2–3), 179–191 (1984)
Ding, K., Ding, C.S.: A class of two-weight and three-weight codes and their applications in secret sharing. IEEE Trans. Inf. Theory 61(11), 5835–5842 (2015)
Ding, C.S., Li, C.L., Li, N., Zhou, Z.C.: Three-weight cyclic codes and their weight distributions. Discrete Math. 339(2), 415–427 (2016)
Ding, C.S., Yuan, J.: Covering and Secret Sharing with Linear Codes, Lecture Notes in Computer Science, vol. 2731, pp. 11–25 (2003)
Ding, C.S., Yang, J.: Hamming weights in irreducible cyclic codes. Discrete Math. 313(4), 434–446 (2011)
Honold, T., Landjev, I.N.: Linear codes over finite chain rings. Electron. J. Comb. 7(1), 116–126 (1999)
Heng, Z.L., Yue, Q.: A class of binary linear codes with at most three weights. IEEE Commun. Lett. 19(9), 1488–1491 (2015)
Heng, Z.L., Yue, Q.: A Class of \(q\)-Ary Linear Codes Derived from Irreducible Cyclic Codes. arXiv:1511.09174v1
Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press, Cambridge (1984)
MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)
Massy, J.L.: Minimal codewords and secret sharing. In: Proceedings of the 6th Joint Swedish-Russian Workshop on Information Theory, Mölle, pp. 276–279 (1993)
Shi, M.J., Liu, Y., Solé, P.: Optimal two-weight codes from trace codes over \( {\mathbb{F}}_{2}+u{\mathbb{F}}_{2}\). IEEE Commun. Lett. 20(12), 2346–2349 (2016)
Shi, M.J., Liu, Y., Solé, P.: Optimal two weight codes from trace codes over a non-chain ring. Discrete Appl. Math. 219, 176–181 (2017)
Shi, M.J., Liu, Y., Solé, P.: Two-weight and three-weight codes from trace codes over \({\mathbb{F}}_{p}+u{\mathbb{F}}_{p}+v{\mathbb{F}}_{p}+uv{\mathbb{F}}_{p}\). Discrete Math. (2017). doi:10.1016/j.disc.2017.09.003
Shi, M.J., Wu, R.S., Liu, Y., Solé, P.: Two and three-weight codes over \({\mathbb{F}}_{p}+u{\mathbb{F}}_{p}\). Cryptogr. Commun. Discrete Struct. Boolean Funct. Seq. 9, 637–646 (2017)
Author information
Authors and Affiliations
Corresponding author
Additional information
This first author is supported by National Natural Science Foundation of China (61672036), Technology Foundation for Selected Overseas Chinese Scholar, Ministry of Personnel of China (05015133) and the Open Research Fund of National Mobile Communications Research Laboratory, Southeast University (2015D11) and Key projects of support program for outstanding young talents in Colleges and Universities (gxyqZD2016008). The second author is supported by the Project of Graduate Academic Innovation of Anhui University (No. yfc100015).
Rights and permissions
About this article
Cite this article
Shi, M., Qian, L. & Solé, P. Few-weight codes from trace codes over a local ring. AAECC 29, 335–350 (2018). https://doi.org/10.1007/s00200-017-0345-8
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00200-017-0345-8