Almost Affine Codes

Designs, Codes, and Cryptography

Volumn 14, Issue 2, 1998, Pages 179-197

  Simonis, Juriaan ^a   Ashikhmin, Alexei ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Delsarte inequalities; Finite geometry; Linear code; Secret sharing scheme

Indexed keywords

EID: 0011309023     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008244215660     Document Type: Article

References (18)

1. A. Beimel and B. Chor, Universally ideal secret sharing schemes, IEEE Transactions on Information Theory, Vol. 40 (1994) pp. 786-794.
2. M. Bertilsson, Linear codes and secret sharing, PhD Thesis, Linköping University (1993).
3. G. R. Blakley and G. A. Kabatianskii, Linear algebra approach to secret sharing schemes, Error control, cryptology, and speach compression (Moscow, 1993), pp. 33-40. Lecture Notes in Comput. Sci. Springer, Berlin, 829 (1994).
4. E. F. Brickell and D. M. Davenport, On the classification of ideal secret sharing schemes, Journal of Cryptology, Vol. 4 (1991) pp. 123-134.
5. F. Buekenhout (ed.), Handbook of Incidence Geometry, Elsevier, Amsterdam (1995).
6. P. Delsarte, An algebraic approach to the association schemes of coding theory, Philips Research Reports Supplements, No. 10 (1973).
7. M. van Dijk, A linear construction of perfect secret sharing schemes, Advances in Cryptology - EUROCRYPT 94, Lecture Notes in Comput. Sci., Springer, Berlin, 950 (1995) pp. 23-34.
8. W. A. Jackson and K. M. Martin, Geometric secret sharing schemes and their duals, Designs, Codes and Cryptography, Vol. 4 (1994) pp. 83-95.
9. J. G. Oxley, Matroid Theory, Oxford University Press, Oxford (1992).
10. G. Pilz, Near-rings, North-Holland, Amsterdam (1977).
11. P. D. Seymour, On secret-sharing matroids, Journal of Combinatorial Theory B, Vol. 56 (1992) pp. 69-73.
12. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam (1983).
13. G. J. Simmons, How to (really) share a secret, Advances in Cryptology - CRYPTO 88, Lecture Notes in Comput. Sci., Springer, Berlin, 403 (1990) pp. 390-448.
14. J. Simonis, MacWilliams identities and coordinate partitions, Linear Algebra and its Applications, Vol. 216 (1995) pp. 81-91.
15. F. W. Stevenson, Projective Planes, Freeman, San Francisco (1972).
16. L. M. G. M. Tolhuizen, On maximum distance separable codes over alphabets of arbitrary size, Proc. 1994 IEEE International Symposium on Information Theory, Trondheim (1994) p. 431.
17. J. H. Van Lint and R. M. Wilson, A Course in Combinatorics, Cambridge U.P., Cambridge (1992).
18. D. J. A. Welsh, Matroid Theory, Academic Press, London (1976).