Secret Sharing Schemes from Linear Codes overFp + vFp

DOI10.1142/S0129054116500180zbMath1358.94082OpenAlexW2526890554MaRDI QIDQ2833544

Fang-Wei Fu, Xianfang Wang, Jian Gao

Publication date: 18 November 2016

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054116500180

zbMATH Keywords

secret sharingaccess structureMacDonald codesfinite non-chain ring

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cryptography (94A60)

Related Items (4)

Bounds on covering radius of linear codes with Chinese Euclidean distance over the finite non chain ring \(\mathbb F_2+v\mathbb F_2\) ⋮ Complete weight enumerator of torsion codes ⋮ Complete weight enumerators of two classes of linear codes ⋮ MacDonald codes over the ring \(\mathbb{F}_p + v\mathbb{F}_p + v^2\mathbb{F}_p\)

Cites Work

• The Magma algebra system. I: The user language
• How to share a secret
• Secret sharing schemes from three classes of linear codes
• Minimal vectors in linear codes

This page was built for publication: Secret Sharing Schemes from Linear Codes overFp + vFp