Abstract
Minimal linear codes are linear codes such that the support of every codeword does not contain the support of another linearly independent codeword. Such codes have applications in cryptography, e.g. to secret sharing. We pursue here their study and construct asymptotically good families of minimal linear codes. We also push further the study of quasi-minimal and almost-minimal linear codes, relaxations of the minimal linear codes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ashikhmin, A.E., Barg, A.: Minimal vectors in linear codes. IEEE Trans. Inf. Theory 44(5), 2010–2017 (1998)
Brassard, G., Crépeau, C., Santha, M.: Oblivious transfers and intersecting codes. IEEE Trans. Inf. Theory 42(6), 1769–1780 (1996)
Chabanne, H., Cohen, G., Patey, A.: Towards secure two-party computation from the wire-tap channel (2013). arXiv:1306.6265
Cohen, G.D., Lempel, A.: Linear intersecting codes. Discret. Math. 56(1), 35–43 (1985)
Cohen, G.D., Encheva, S.B., Litsyn, S., Schaathun, H.G.: Intersecting codes and separating codes. Discret. Appl. Math. 128(1), 75–83 (2003)
Cohen, G., Mesnager, S., Patey, A.: On minimal and quasi-minimal linear codes. In: Proceedings of Fourteenth International Conference on Cryptography and Coding (IMACC 2013), Oxford. Lecture Notes in Computer Science, vol. 8308, pp. 85–98. Springer, Heidelberg (2013)
Ding, C., Yuan, J.: Covering and secret sharing with linear codes. In: Calude, C., Dinneen, M.J., Vajnovszki, V. (eds.) Discrete Mathematics & Theoretical Computer Science, DMTCS Dijon 2003. Lecture Notes in Computer Science, vol. 2731, pp. 11–25. Springer, Berlin (2003)
Gilbert, E.N.: A comparison of signalling alphabets. Bell Syst. Tech. J. 31(3), 504–522 (1952)
MacWilliams, F.J., Sloane, N.J.: The theory of error-correcting codes. North Holland, Amsterdam (1977)
Massey, J.L.: Minimal codewords and secret sharing. In: Proceedings of 6th Joint Swedish-Russian International Workshop on Information Theory, Molle, pp. 276–279 (1993)
Massey, J.L.: Some applications of coding theory in cryptography. In: Farrell, P.G. (ed.) Codes and Cyphers: Cryptography and Coding IV, pp. 33–47. Formara Ltd, Southend-on-Sea (1995)
Schaathun, H.G.: The Boneh-Shaw fingerprinting scheme is better than we thought. IEEE Trans. Inf. Forensics Secur. 1(2), 248–255 (2006)
Song, Y., Li, Z.: Secret sharing with a class of minimal linear codes (2012). arXiv:1202.4058
Tsfasman, M.A., Vladut, S.G.: Algebraic-Geometric Codes. Kluwer, Dordrecht (1991)
Acknowledgements
We thank Alexander Barg, Alain Patey and Zachi Tamo for helpful discussions.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Cohen, G., Mesnager, S. (2015). Variations on Minimal Linear Codes. In: Pinto, R., Rocha Malonek, P., Vettori, P. (eds) Coding Theory and Applications. CIM Series in Mathematical Sciences, vol 3. Springer, Cham. https://doi.org/10.1007/978-3-319-17296-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-17296-5_12
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-17295-8
Online ISBN: 978-3-319-17296-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)