Some codes over \(\mathcal{R} = \mathcal{R}_1\mathcal{R}_2\mathcal{R}_3\) and their applications in secret sharing schemes
From MaRDI portal
Publication:6179370
DOI10.1007/s13370-023-01143-8OpenAlexW4388940064MaRDI QIDQ6179370
Publication date: 16 January 2024
Published in: Afrika Matematika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13370-023-01143-8
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Applications to coding theory and cryptography of arithmetic geometry (14G50) Finite fields and commutative rings (number-theoretic aspects) (11Txx)
Cites Work
- Unnamed Item
- Unnamed Item
- On some classes of linear codes over \(\mathbb{Z}_2\mathbb{Z}_4\) and their covering radii
- Secret-sharing with a class of ternary codes
- Simplex and MacDonald codes over \(R_q\)
- A new class of optimal linear codes with flexible parameters
- New classes of codes over \(R_{q,p,m}=\mathbb{Z}_{p^m}[u_1, u_2, \dots , u_q/ \langle u_i^2=0,u_iu_j=u_ju_i\rangle\) and their applications]
- MacDonald codes over the ring \(\mathbb{F}_p + v\mathbb{F}_p + v^2\mathbb{F}_p\)
- Minimal vectors in linear codes
This page was built for publication: Some codes over \(\mathcal{R} = \mathcal{R}_1\mathcal{R}_2\mathcal{R}_3\) and their applications in secret sharing schemes
