Almost affine codes
From MaRDI portal
Publication:1389155
Recommendations
- Parameterized affine codes
- Affine Grassmann Codes
- Affine nonsystematic codes
- Affine Cartesian codes
- Almost cover-free codes
- scientific article; zbMATH DE number 2185736
- Parameters of the codes over affine varieties
- scientific article; zbMATH DE number 4104864
- scientific article; zbMATH DE number 704211
- Affine Reflection Group Codes
Cited in
(32)- Problems of isomorphy concerning the algebraic representation of affine MDS-codes.
- Relative profiles and extended weight polynomials of almost affine codes
- Matroids Can Be Far from Ideal Secret Sharing
- Affine 3-nonsystematic codes
- Secret-sharing matroids need not be algebraic
- Ideal multipartite secret sharing schemes
- Von Staudt constructions for skew-linear and multilinear matroids
- The free product of \(M\)-fuzzifying matroids
- Matroid representations by partitions
- Weight spectra of Gabidulin rank-metric codes and Betti numbers
- On ideal homomorphic secret sharing schemes and their decomposition
- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
- Hypergraph decomposition and secret sharing
- Flags of almost affine codes and the two-party wire-TAP channel of type II
- A note on representing Dowling geometries by partitions.
- Secret sharing schemes for ports of matroids of rank 3.
- Classes of matroids closed under minors and principal extensions
- Common information, matroid representation, and secret sharing for matroid ports
- On abelian and homomorphic secret sharing schemes
- Powerful sets: a generalisation of binary matroids
- On ideal and weakly-ideal access structures
- Secret sharing schemes on access structures with intersection number equal to one
- Affine Reflection Group Codes
- Parameterized affine codes
- Blocked linear secret sharing scheme for scalable attribute based encryption in manageable cloud storage system
- Ideal secret sharing schemes for useful multipartite access structures
- On secret sharing schemes, matroids and polymatroids
- Representability of matroids by \(c\)-arrangements is undecidable
- Ideal hierarchical secret sharing and lattice path matroids
- Extending Brickell-Davenport theorem to non-perfect secret sharing schemes
- Secret-Sharing Schemes: A Survey
- Codes with the rank metric and matroids
This page was built for publication: Almost affine codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1389155)
