Multisecret-sharing schemes and bounded distance decoding of linear codes

DOI10.1080/00207160.2015.1091071zbMath1386.94093OpenAlexW2266598988MaRDI QIDQ5737854

Selda Çalkavur, Patrick Solé

Publication date: 30 May 2017

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

Full work available at URL: https://doi.org/10.1080/00207160.2015.1091071

zbMATH Keywords

linear codesecret sharingideal secret sharingbounded distance decodingmultisecret-sharing

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

LCD matrix product codes with an application ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Secret-sharing with a class of ternary codes
• How to share a secret
• Secret sharing schemes from three classes of linear codes
• On the inherent intractability of certain coding problems (Corresp.)
• MDS secret-sharing scheme secure against cheaters
• On secret sharing systems

This page was built for publication: Multisecret-sharing schemes and bounded distance decoding of linear codes