Pages that link to "Item:Q2833544"
From MaRDI portal
The following pages link to Secret sharing schemes from linear codes over \(\mathbb F_p + v \mathbb F_p\) (Q2833544):
Displaying 8 items.
- Bounds on covering radius of linear codes with Chinese Euclidean distance over the finite non chain ring \(\mathbb F_2+v\mathbb F_2\) (Q1653025) (← links)
- Optimal codes from Fibonacci polynomials and secret sharing schemes (Q1690548) (← links)
- Complete weight enumerator of torsion codes (Q2158237) (← links)
- MacDonald codes over the ring \(\mathbb{F}_p + v\mathbb{F}_p + v^2\mathbb{F}_p\) (Q2326362) (← links)
- Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions (Q2948388) (← links)
- On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes (Q5451034) (← links)
- Complete weight enumerators of two classes of linear codes (Q5892376) (← links)
- A verifiable multi-secret sharing scheme based on \(\ell\)-intersection pair of cyclic codes (Q6660953) (← links)