Some codes over $${\mathcal {R}}={\mathcal {R}}_{1}{\mathcal {R}}_{2}{\mathcal {R}}_{3} $$ and their applications in secret sharing schemes

Chatouh, Karima

doi:10.1007/s13370-023-01143-8

Afr. Mat.

2023

DOI: 10.1007/s13370-023-01143-8

|View full text |Cite

Some codes over $${\mathcal {R}}={\mathcal {R}}_{1}{\mathcal {R}}_{2}{\mathcal {R}}_{3} $$ and their applications in secret sharing schemes

Karima Chatouh

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

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

Chatouh

2024

Mat. Stud.

View full text Add to dashboard Cite

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.

show abstract

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

Chatouh

2024

Mat. Stud.

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Some codes over $${\mathcal {R}}={\mathcal {R}}_{1}{\mathcal {R}}_{2}{\mathcal {R}}_{3} $$ and their applications in secret sharing schemes

Cited by 1 publication

References 6 publications

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

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

Contact Info

Product

Resources

About