Enhanced multisecret-sharing schemes using LCD codes and weighing orthogonal matrices
From MaRDI portal
Cites work
- Code based secret sharing schemes. Applied combinatorial coding theory
- Cryptography in an algebraic alphabet.
- DNA multi-secret sharing schemes based on linear codes over \(\mathbb{Z}_4 \times R\)
- Encryption schemes based on Hadamard matrices with circulant cores
- Encryption schemes using anti-orthogonal of type I matrices
- Encryption Schemes using Finite Frames and Hadamard Arrays
- Erasure techniques in MRD codes.
- How to share a secret
- scientific article; zbMATH DE number 1543059 (Why is no real title available?)
- scientific article; zbMATH DE number 6900653 (Why is no real title available?)
- LCD codes constructed from weakly p-self-orthogonal 1-designs
- LCD codes from weighing matrices
- LCD codes over finite fields
- Linear codes with complementary duals
- Linearity and complements in projective space
- Multisecret-sharing schemes and bounded distance decoding of linear codes
- On explicit Wiener-Hopf factorization of \(2 \times 2\) matrices in a vicinity of a given matrix
- Orthogonal Matrices with Zero Diagonal. II
- Quantum multi-secret sharing scheme with access structures and cheat identification
- Secret sharing schemes based on the dual of Golay codes
- The combinatorics of LCD codes: linear programming bound and orthogonal matrices
This page was built for publication: Enhanced multisecret-sharing schemes using LCD codes and weighing orthogonal matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6942371)
