Top

Cryptography and Communications

Published in:

27-02-2021

An inductive construction of minimal codes

Authors: Daniele Bartoli, Matteo Bonini, Burçin Güneş

Published in: Cryptography and Communications | Issue 3/2021

Activate our intelligent search to find suitable subject content or patents.

search-config

AI-assisted search

Off

Abstract

We provide new families of minimal codes in any characteristic, useful for the construction of secret sharing schemes. Also, an inductive construction of minimal codes is presented.

previous article Construction of binary Hadamard codes and their s-PD sets

next article Separation results for boolean function classes

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Ashikhmin, A., Barg, A.: Minimal vectors in linear codes. IEEE Trans. Inf. Theory. 44, 2010–2017 (1998)MathSciNetCrossRef

Bartoli, D, Bonini, M: Minimal linear codes in odd characteristic. IEEE Trans. Inform. Theory. 65, 4152–4155 (2019)MathSciNetCrossRef

Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.A.: On the inherent intractability of certain coding problems. IEEE Trans. Inform. Theory. 24, 384–386 (1978)MathSciNetCrossRef

Blakley, G.R.: Safeguarding cryptographic keys. In: Proc. of AFIPS National Computer Conference, pp. 313–317. New York (1979)

Bonini, M., Borello, M.: Minimal linear codes arising from blocking sets. J. Algebr. Comb. https://doi.org/10.1007/s10801-019-00930-6 (2020)

Carlet, C., Ding, C., Yuan, J.: Linear codes from highly nonlinear functions and their secret sharing schemes. IEEE Trans. Inf. Theory. 51, 2089–2102 (2005)CrossRef

Chabanne, H., Cohen, G., Patey, A.: Towards secure two-party computation from the wire-tap channel. In: Information Security and Cryptology – ICISC 2013, pp. 34–46. Heidelberg (2014)

Chang, S., Hyun, J.Y.: Linear codes from simplicial complexes. Des. Codes Cryptogr. 86, 2167–2181 (2018)MathSciNetCrossRef

Bruck, J, Naor, M.: The hardness of decoding linear codes with preprocessing. IEEE Trans. Inform. Theory. 36, 381–385 (1990)MathSciNetCrossRef

10.

Cohen, G.D., Mesnager, S., Patey, A.: On minimal and quasi-minimal linear codes. In: IMACC 2013 pp. 85–98. Heidelberg (2013)

11.

Ding, C.: Linear codes from some 2-designs. IEEE Trans. Inf. Theory. 60, 3265–3275 (2015)MathSciNetCrossRef

12.

Ding, C., Heng, Z., Zhou, Z.: Minimal binary linear codes. IEEE Trans. Inf. Theory. 64, 6536–6545 (2018)MathSciNetCrossRef

13.

Ding, C., Li, N., Li, C., Zhou, Z.: Three-weight cyclic codes and their weight distributions. Discrete Math. 339, 415–427 (2016)MathSciNetCrossRef

14.

Ding, C., Yuan, J.: Covering and secret sharing with linear codes. In: DMTCS 2003, pp.11–25. Heidelberg (2003)

15.

Heng, Z., Ding, C., Zhou, Z: Minimal linear codes over finite fields. Finite Fields Appl. 54, 176–196 (2018)MathSciNetCrossRef

16.

Klove, T.: Codes for Error Detection Series on Coding Theory and Cryptology, vol. 2. World Scientific Publishing Co. Pte. Ltd., Hackensack (2007)

17.

Massey, J.L.: Minimal codewords and secret sharing (1993)

18.

Massey, J.L.: Some applications of coding theory in cryptography. In Codes and Cyphers: Cryptography and Coding IV, pp. 33–47. Esses (1995)

19.

Shamir, A.: How to share a secret. Commun. ACM 22, 612–613 (1979)MathSciNetCrossRef

20.

Song, Y., Li, Z.: Secret sharing with a class of minimal linear codes. arXiv:https://arxiv.org/abs/1202.4058 (2012). Accessed 20 October 2020

21.

Yuan, J., Ding, C.: Secret sharing schemes from three classes of linear codes. IEEE Trans. Inf. Theory. 52, 206–212 (2006)MathSciNetCrossRef

Title: An inductive construction of minimal codes
Authors: Daniele Bartoli
Matteo Bonini
Burçin Güneş
Publication date: 27-02-2021
Publisher: Springer US
Published in: Cryptography and Communications / Issue 3/2021
Print ISSN: 1936-2447
Electronic ISSN: 1936-2455
DOI: https://doi.org/10.1007/s12095-021-00474-2

Springer Professional

Abstract

Please log in to get access to your license.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Other articles of this Issue 3/2021

Separation results for boolean function classes

On CCZ-inequivalence of some families of almost perfect nonlinear functions to permutations

More permutations and involutions for constructing bent functions

Boolean functions with six-valued Walsh spectra and their application

Construction of binary Hadamard codes and their s-PD sets

Quiescent photonics side channel analysis: Low cost SRAM readout attack

Premium Partner