Linear Codes over $\mathbb{Z}_{p}\mathcal{R}_{1} \mathcal{R}_{2}$ and their Applications
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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | deu |
| Published: |
Ivan Franko National University of Lviv
2024-09-01
|
| Series: | Математичні Студії |
| Subjects: | |
| Online Access: | http://matstud.org.ua/ojs/index.php/matstud/article/view/526 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849429487474704384 |
|---|---|
| author | K. Chatouh |
| author_facet | K. Chatouh |
| author_sort | K. Chatouh |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-98c4acb7b8fc48d991f404570002dd8d |
| institution | Kabale University |
| issn | 1027-4634 2411-0620 |
| language | deu |
| publishDate | 2024-09-01 |
| publisher | Ivan Franko National University of Lviv |
| record_format | Article |
| series | Математичні Студії |
| spelling | doaj-art-98c4acb7b8fc48d991f404570002dd8d2025-08-20T03:28:21ZdeuIvan Franko National University of LvivМатематичні Студії1027-46342411-06202024-09-0162131010.30970/ms.62.1.3-10526Linear Codes over $\mathbb{Z}_{p}\mathcal{R}_{1} \mathcal{R}_{2}$ and their ApplicationsK. Chatouh0University of Batna 1, Batna, AlgeriaIn 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.http://matstud.org.ua/ojs/index.php/matstud/article/view/526linear codessimplex codes;macdonald codessecret-sharing schemes |
| spellingShingle | K. Chatouh Linear Codes over $\mathbb{Z}_{p}\mathcal{R}_{1} \mathcal{R}_{2}$ and their Applications Математичні Студії linear codes simplex codes; macdonald codes secret-sharing schemes |
| title | Linear Codes over $\mathbb{Z}_{p}\mathcal{R}_{1} \mathcal{R}_{2}$ and their Applications |
| title_full | Linear Codes over $\mathbb{Z}_{p}\mathcal{R}_{1} \mathcal{R}_{2}$ and their Applications |
| title_fullStr | Linear Codes over $\mathbb{Z}_{p}\mathcal{R}_{1} \mathcal{R}_{2}$ and their Applications |
| title_full_unstemmed | Linear Codes over $\mathbb{Z}_{p}\mathcal{R}_{1} \mathcal{R}_{2}$ and their Applications |
| title_short | Linear Codes over $\mathbb{Z}_{p}\mathcal{R}_{1} \mathcal{R}_{2}$ and their Applications |
| title_sort | linear codes over mathbb z p mathcal r 1 mathcal r 2 and their applications |
| topic | linear codes simplex codes; macdonald codes secret-sharing schemes |
| url | http://matstud.org.ua/ojs/index.php/matstud/article/view/526 |
| work_keys_str_mv | AT kchatouh linearcodesovermathbbzpmathcalr1mathcalr2andtheirapplications |