Secret sharing schemes based on additive codes over \(\mathrm{GF}(4)\)
From MaRDI portal
Publication:2397159
DOI10.1007/s00200-016-0296-5zbMath1384.94120arXiv1701.04183OpenAlexW2488786572MaRDI QIDQ2397159
Publication date: 29 May 2017
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.04183
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Authentication, digital signatures and secret sharing (94A62)
Related Items (2)
Algebraic structure of additive conjucyclic codes over \(\mathbb{F}_4\) ⋮ Additive and linear conjucyclic codes over \(\mathbb{F}_4\)
Cites Work
- Unnamed Item
- Unnamed Item
- Secret sharing schemes from binary linear codes
- Self-dual codes over GF(4)
- Designs in additive codes over GF(4)
- Self-dual codes over the Kleinian four group
- Secret-sharing with a class of ternary codes
- How to share a secret
- The accessibility of an access structure
- Secret sharing schemes from three classes of linear codes
- Fundamentals of Error-Correcting Codes
- Four fundamental parameters of a code and their combinatorial significance
- New 5-designs
This page was built for publication: Secret sharing schemes based on additive codes over \(\mathrm{GF}(4)\)