Abstract
Simplex and MacDonald codes have received significant attention from researchers since the inception of coding theory. In this work, we present the construction of linear torsion codes for simplex and MacDonald codes over the ring \({\mathcal {R}}={\mathcal {R}}_{1}{\mathcal {R}}_{2}{\mathcal {R}}_{3}\). We have introduced a novel family of linear codes over \({\mathbb {F}}_{p}\). These codes have been extensively examined with respect to their properties, such as code minimality, weight distribution, and their applications in secret sharing schemes. In addition to this investigation, we have discovered that these codes are also applicable to the association schemes of linear torsion codes for simplex and MacDonald codes over. \({\mathcal {R}}={\mathcal {R}}_{1}{\mathcal {R}}_{2}{\mathcal {R}}_{3}\).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ashikhmin A, Barg A.: Minimal vectors in linear codes and sharing of secrets. In: Willems, F. M. J. (Ed) Proceedings of the EIDMA Winter Meeting on Coding Theory, Information Theory and Cryptology, Veldhoven, The Netherlands (1994)
Chatouh, K., Guenda, K., Gulliver, T.A., Noui, L.: On some classes of linear codes over \({\mathbb{Z} }_{2}{\mathbb{Z} }_{4}\) and their covering radii. J. Appl. Math. Comput 53(1), 201–222 (2017)
Chatouh, K., Guenda, K., Gulliver, T.A., Noui, L.: Simplex and MacDonald codes over \(R_{q}\). J. Appl. Math. Comput 55(1–2), 455–478 (2017)
Chatouh, K., Guenda, K., Gulliver, T.A.: New Classes of Codes Over \(R_{q, p, m}={\mathbb{Z} }_{p^{m}}[u_{1}, u_{2}, \ldots , u_{ q}]/\left\langle u_{i}^{2}=0, u_{i}u_{j}=u_{j}u_{i}\right\rangle \) and their applications. Comput. Appl. Math. 39(3), 1–39 (2020)
Delsarte, Philippe: An algebraic approach to the association schemes of coding theory. Philips Res. Rep. Suppl. 10, 97 (1973)
Ding, C., Kohelb, D.R., Ling, S.: Secret-sharing with a class of ternary codes. Theor. Comput. Sci. 246, 285–298 (2000)
Ku-Cauich, J.C., Tapia-Recillas, H.: Secret sharing schemes based on almost-bent functions. Int. J. Pure Appl. Math. 57(1), 87–102 (2009)
Luo, G., et al.: A new class of optimal linear codes with flexible parameters. Disc. Appl. Math. 237, 126–131 (2018)
Wang, Y., Gao, J.: MacDonald codes ove the ring \({\mathbb{F} }_{p} + v{\mathbb{F} }_{p} + v^{2}{\mathbb{F} }_{p}\). J. Comput. Appl. Math. 38, 169 (2019)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Chatouh, K. Some codes over \({\mathcal {R}}={\mathcal {R}}_{1}{\mathcal {R}}_{2}{\mathcal {R}}_{3} \) and their applications in secret sharing schemes. Afr. Mat. 35, 1 (2024). https://doi.org/10.1007/s13370-023-01143-8
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s13370-023-01143-8