Orthogonal matrix and its application in Bloom's threshold scheme
From MaRDI portal
Publication:2631929
Recommendations
- scientific article; zbMATH DE number 540100
- scientific article; zbMATH DE number 1980983
- scientific article; zbMATH DE number 2128113
- scientific article; zbMATH DE number 4075078
- Approximating orthogonal matrices by permutation matrices
- Orthogonal, antiorthogonal and self-orthogonal matrices and their codes
- Application of Orthogonal Polynomials and Special Matrices to Orthogonal Arrays
- Orthogonal arryas and their applications
- An iterative algorithm for approximate orthogonalisation of symmetric matrices
- An Optimal Bloom Filter Replacement Based on Matrix Solving
Cites work
- scientific article; zbMATH DE number 3912274 (Why is no real title available?)
- scientific article; zbMATH DE number 1031003 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A \((t, n)\) threshold secret sharing system with efficient identification of cheaters
- A linear time matrix key agreement protocol over small finite fields
- How to share a secret
- Numerics of Gram-Schmidt orthogonalization
- On the inversion of the Vandermonde matrix
- Orthogonal Matrices Over Finite Fields
- Solution of Vandermonde systems of equations
- Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
This page was built for publication: Orthogonal matrix and its application in Bloom's threshold scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2631929)