Linear Codes over $\mathbb{Z}_{p}\mathcal{R}_{1} \mathcal{R}_{2}$ and their Applications

K. Chatouh

doi:10.30970/ms.62.1.3-10

K. Chatouh University of Batna 1, Batna, Algeria

DOI: https://doi.org/10.30970/ms.62.1.3-10

Анотація

In the paper, we explore the simplex and MacDonald codes over the finite ring $\mathbb{Z}_{p}\mathcal{R}_{1} \mathcal{R}_{2}$. Our investigation focuses on the unique properties of these codes, with the particular attention to their weight distributions and Gray images. The weight distribution is a crucial aspect as it provides insights into the error-detection and error-correction capabilities of the codes. Gray images play a significant role in understanding the structure and behavior of these codes. By examining the dual Gray images of simplex and MacDonald codes over $\mathbb{Z}_{p}\mathcal{R}_{1} \mathcal{R}_{2}$, we aim to develop efficient secret sharing schemes. These schemes benefit from the inherent properties of the codes, such as minimal weight and redundancy, which are essential for secure and reliable information sharing. Understanding the access structure of these schemes is vital, as it determines which subsets of participants can reconstruct the secret. Our study draws on various properties to elucidate this access structure, ensuring that the schemes are secure and efficient. Through this comprehensive analysis, we contribute to the field of coding theory by demonstrating how simplex and MacDonald codes over $\mathbb{Z}_{p}\mathcal{R}_{1} \mathcal{R}_{2}$ can be effectively utilized in cryptographic applications, particularly in designing robust and reliable secret sharing mechanisms.

Біографія автора

K. Chatouh, University of Batna 1, Batna, Algeria

University of Batna 1, Batna, Algeria

Посилання

A. Ashikhmin and A. Barg, Minimal vectors in linear codes and sharing of secrets, Proc. EIDMA Winter Meeting on Coding Theory, Information Theory and Cryptology (Veldhoven, Netherlands, 1994), Henk C.A. van Tilborg, Frans M.J. Willems (Eds.), 1994, 41.

M.C. Bhandari, M.K. Gupta, A.K. Lal, On $mathbb{Z}_{4}$-simplex codes and their gray images, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-13, Lecture Notes Comput. Sc., 1719 (1999), 170–180.

J.C. Ku-Cauich, H. Tapia-Recillas, Secret sharing schemes based on almost-bent functions, Int. J. Pure Appl. Math., 57 (2009), 87–102.

K. Chatouh, K. Guenda, T.A. Gulliver, L. Noui, On some classes of linear codes over $mathbb{Z}_{2}mathbb{Z}_{4}$ and their covering radii, J. Appl. Math. Comput., 53 (2017), 201–222.

K. Chatouh, K. Guenda, T.A. Gulliver, L. Noui, Simplex and MacDonald codes over $R_{q}$, J. Appl. Math. Comput., 55 (2017), 455–478.

K. Chatouh, K. Guenda, T.A. Gulliver, New classes of codes over $R_{q,p,m}=mathbb{Z}_{p^{m}}[u_{1}, u_{2}, cdots, u_{ q}]/$ $leftlangle u_{i}^{2}=0,u_{i}u_{j}=u_{j}u_{i}rightrangle$ and their applications, Comp. Appl. Math., 39 (2020), №152, 1–39. https://doi.org/10.1007/s40314-020-01181-z

K. Chatouh, Some codes over $mathcal{R}=mathcal{R}_{1}mathcal{R}_{2}mathcal{R}_{3}$ and their applications in secret sharing schemes, Afr. Math., 35 (2024), №1. https://doi.org/10.1007/s13370-023-01143-8

J. Chen, Y. Huang, B. Fu, J. Li, Secret sharing schemes from a class of linear codes over finite chain ring, J. Comput. Inform. Syst., 9 (2013), 2777–2784.

C.J. Colbourn, M.K. Gupta, On quaternary MacDonald codes, Proc. Int. Conf. on Inform. Tech.: Coding and Computing, 2003, 212–215.

D. Ding, D.R. Kohelb, S. Ling, Secret-sharing with a class of ternary codes, Theoretical Computer Science, 246 (2000), 285–298.

M.K. Gupta, C. Durairajan, On the covering radius of some modular codes, arXiv:1206.3038v2 [cs.IT] 25 Jun. 2012, 13. https://doi.org/10.48550/arXiv.1206.3038

M.K. Gupta, On Some Linear Codes over $mathbb{Z}_{2^{s}}$, Ph.D. Thesis, IIT, Kanpur, 1999.

A. Melakhessou, K. Chatouh, K. Guenda, DNA multi-secret sharing schemes based on linear codes over $mathbb{Z}_4times R$, J. Appl. Math. Comp., 69 (2023), №6, 4833–4853. https://doi.org/10.1007/s12190-023-01941-0