Almost affine codes
Almost affine \(q\)-ary codes are codes having the property that puncturing in any set of positions results in a code for which the cardinality is a power of \(q\). The most obvious examples are cosets of linear codes. The matroid of an almost affine code is studied. An example is given of a matroid of an almost affine code that is not linearly representable. The connection between almost affine codes and perfect secret sharing schemes is given. It is reproved that binary and ternary almost affine codes are cosets of linear codes. The relation between an almost affine code and the dual of its matrix is explained, and results on the distance distribution and the dual distance distribution are obtained. Finally, the new concept of partial affine geometry is related to almost affine codes.
- 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
- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
- Hypergraph decomposition and secret sharing
- Matroid representations by partitions
- Flags of almost affine codes and the two-party wire-TAP channel of type II
- Powerful sets: a generalisation of binary matroids
- Classes of matroids closed under minors and principal extensions
- On ideal homomorphic secret sharing schemes and their decomposition
- Codes with the rank metric and matroids
- On abelian and homomorphic secret sharing schemes
- Common information, matroid representation, and secret sharing for matroid ports
- Extending Brickell-Davenport theorem to non-perfect secret sharing schemes
- Relative profiles and extended weight polynomials of almost affine codes
- Secret sharing schemes on access structures with intersection number equal to one
- Representability of matroids by c-arrangements is undecidable
- Ideal hierarchical secret sharing and lattice path matroids
- Problems of isomorphy concerning the algebraic representation of affine MDS-codes.
- Secret-sharing matroids need not be algebraic
- Parameterized affine codes
- The free product of M-fuzzifying matroids
- Secret-Sharing Schemes: A Survey
- Ideal secret sharing schemes for useful multipartite access structures
- On secret sharing schemes, matroids and polymatroids
- Affine Reflection Group Codes
- Ideal multipartite secret sharing schemes
- Affine 3-nonsystematic codes
- Matroids Can Be Far from Ideal Secret Sharing
- Secret sharing schemes for ports of matroids of rank 3.
- A note on representing Dowling geometries by partitions.
- Von Staudt constructions for skew-linear and multilinear matroids
- On ideal and weakly-ideal access structures
- Weight spectra of Gabidulin rank-metric codes and Betti numbers
- Optimizing extension techniques for discovering non-algebraic matroids
- Polynomial secret sharing schemes and algebraic matroids
- On entropic and almost multilinear representability of matroids
- Blocked linear secret sharing scheme for scalable attribute based encryption in manageable cloud storage system
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)
