Skip to main content
SpringerLink
Log in

Minimal supports in linear codes

  • Conference paper
  • First Online:
Cryptography and Coding (Cryptography and Coding 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1025))

Included in the following conference series:

  • 2220 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

References

  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. 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. 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 

Download references

Author information

Authors and Affiliations

  1. Faculty of Technical Mathematics and Informatics, Delft University of Technology, P.O.Box 5031, 2600, GA Delft, The Netherlands

    Alexei Ashikhmin

  2. Faculty of Mathematics and Computer Science, Eidnhoven University of Technology, Den Dolech 2, P.O. Box 513, 5600, MB Eindhoven, The Netherlands

    Alexander Barg

Authors
  1. Alexei Ashikhmin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexander Barg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Colin Boyd

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation