Minimal supports in linear codes

  • Alexei Ashikhmin
  • Alexander Barg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1025)


Secret Sharing Linear Code Minimal Support Secret Sharing Scheme Matroid Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    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).Google Scholar
  2. 2.
    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).Google Scholar
  3. 3.
    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).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Alexei Ashikhmin
    • 1
  • Alexander Barg
    • 2
  1. 1.Faculty of Technical Mathematics and InformaticsDelft University of TechnologyGA DelftThe Netherlands
  2. 2.Faculty of Mathematics and Computer ScienceEidnhoven University of TechnologyMB EindhovenThe Netherlands

Personalised recommendations