Almost affine codes

DOI10.1023/A:1008244215660zbMath0901.94024MaRDI QIDQ1389155

Alexei Ashikhmin, Simonis, Juriaan

Publication date: 12 August 1998

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

linear codesfinite geometrymatroidDelsarte inequalitiesdistance distributionpartial affine geometryperfect secret sharing schemes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cryptography (94A60) Other finite nonlinear geometries (51E25)

Related Items (28)

Von Staudt constructions for skew-linear and multilinear matroids ⋮ Secret-sharing matroids need not be algebraic ⋮ Flags of almost affine codes and the two-party wire-TAP channel of type II ⋮ Powerful sets: a generalisation of binary matroids ⋮ On ideal and weakly-ideal access structures ⋮ Weight spectra of Gabidulin rank-metric codes and Betti numbers ⋮ Ideal multipartite secret sharing schemes ⋮ Representability of matroids by \(c\)-arrangements is undecidable ⋮ Ideal hierarchical secret sharing and lattice path matroids ⋮ Common information, matroid representation, and secret sharing for matroid ports ⋮ The free product of M-fuzzifying matroids1 ⋮ Secret-Sharing Schemes: A Survey ⋮ Ideal Secret Sharing Schemes for Useful Multipartite Access Structures ⋮ On ideal homomorphic secret sharing schemes and their decomposition ⋮ Codes with the rank metric and matroids ⋮ Extending Brickell-Davenport theorem to non-perfect secret sharing schemes ⋮ Secret sharing schemes on access structures with intersection number equal to one ⋮ On secret sharing schemes, matroids and polymatroids ⋮ Classes of matroids closed under minors and principal extensions ⋮ Matroids Can Be Far from Ideal Secret Sharing ⋮ Ideal secret sharing schemes whose minimal qualified subsets have at most three participants ⋮ On abelian and homomorphic secret sharing schemes ⋮ Hypergraph decomposition and secret sharing ⋮ Relative profiles and extended weight polynomials of almost affine codes ⋮ Blocked linear secret sharing scheme for scalable attribute based encryption in manageable cloud storage system ⋮ Matroid representations by partitions ⋮ Secret sharing schemes for ports of matroids of rank 3 ⋮ A note on representing dowling geometries by partitions

This page was built for publication: Almost affine codes