References
G. R. Blakley and G. A. Kabatianskii, “Linear algebra approach to secret sharing schemes,” in: Error Control, Cryptology, and Speech Compression, A. Chmora and S. Wicker, Eds., Lect. Notes. Comput. Sci., 829, pp. 33–40 (1994).
A. Ashikhmin and A. Barg, “Minimal vectors in linear codes and sharing of secrets,” submitted to IEEE Trans. Inform. Theory, also Preprint 94-113, SFB 343, Bielefeld University (1994).
A. Ashikhmin, A. Barg, G. Cohen, and L. Huguet, “Variations on minimal codewords in linear codes,” in: Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, G. Cohen, T. Mora, and M. Giusti, Eds., Lect. Notes Comput. Sci., 948, pp. 96–105 (1995).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ashikhmin, A., Barg, A. (1995). Minimal supports in linear codes. In: Boyd, C. (eds) Cryptography and Coding. Cryptography and Coding 1995. Lecture Notes in Computer Science, vol 1025. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60693-9_3
Download citation
DOI: https://doi.org/10.1007/3-540-60693-9_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60693-2
Online ISBN: 978-3-540-49280-1
eBook Packages: Springer Book Archive