nach oben

Designs, Codes and Cryptography

Erschienen in:

11.09.2020

Optimal minimal linear codes from posets

verfasst von: Jong Yoon Hyun, Hyun Kwang Kim, Yansheng Wu, Qin Yue

Erschienen in: Designs, Codes and Cryptography | Ausgabe 12/2020

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

Recently, some infinite families of minimal and optimal binary linear codes were constructed from simplicial complexes by Hyun et al. We extend this construction method to arbitrary posets. Especially, anti-chains are corresponded to simplicial complexes. In this paper, we present two constructions of binary linear codes from hierarchical posets of two levels. In particular, we determine the weight distributions of binary linear codes associated with hierarchical posets with two levels. Based on these results, we also obtain some optimal and minimal binary linear codes not satisfying the condition of Ashikhmin–Barg.

Vorheriger Artikel Binary primitive LCD BCH codes

Nächster Artikel Two families of two-weight codes over

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. Inf. Theory 65, 4152–4155 (2019).MathSciNetCrossRef

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: Proceedings of ICISC 2013(Lecture Notes in Computer Science, vol. 8565), H.-S. Lee and D.-G. Han Eds. Berlin: Springer-Verlag, 34-46 (2014)

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

Cohen G., Mesnager S., Patey A.: On minimal and quasi-minimal linear codes, in: Proceedings of IMACC (Lecture Notes in Computer Science, vol. 8308), M. Stam, Eds. Berlin: Springer-Verlag, 85-98 (2003)

Ding C.: A construction of binary linear codes from Boolean functions. Discret. Math. 339, 2288–2303 (2016).MathSciNetCrossRef

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

Ding C., Yuan J.: Covering and secret sharing with linear codes, in: Discrete Mathematics and Theoretical Computer Science, Lecture Notes in Computer Science 2731, Springer Verlag, 11-25 (2003)

10.

Grassl M.: Bounds on the minimum distance of linear codes. http://www.codetables.de.

11.

Griesmer J.H.: A bound for error correcting codes. IBM J. Res. Dev. 4, 532–542 (1960).MathSciNetCrossRef

12.

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

13.

Huffman W.C., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003).CrossRef

14.

Hyun J.Y., Lee J., Lee Y.: Infinite families of optimal linear codes constructed from simplicial complexes. IEEE Trans. Inf. Theory (2020). https://doi.org/10.1109/TIT.2020.2993179.CrossRef

15.

Kong X., Yang S.: Complete weight enumerators of a class of linear codes with two or three weights. Discret. Math. 342(11), 3166–3176 (2019).MathSciNetCrossRef

16.

Massey J. L.: Minimal codewords and secret sharing, in: Proc. 6th Joint Swedish-Russian Workshop on Information Theory, Mölle, Sweden, 246-249 (1993).

17.

Mesnager S.: Linear codes with few weights from weakly regular bent functions based on a generic construction. Cryptogr. Commun. 9, 71–84 (2017).MathSciNetCrossRef

18.

Wadayama T., Hada T., Wakasugi K., Kasahara M.: Upper and lower bounds on maximum nonlinearity of \(n\)-input \(m\)-output Boolean function. Des. Codes Cryptogr. 23, 23–33 (2001).MathSciNetCrossRef

19.

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

20.

Wu Y., Hyun J.Y.: Few-weight codes over \(F_p+uF_p\) associated with down sets and their distance optimal Gray image. Discret. Appl. Math. 283, 315–322 (2020).CrossRef

21.

Wu Y., Lee Y.: Binary LCD and self-orthogonal codes via simplicial complexes. IEEE Commun. Lett. 24(6), 1159–1162 (2020).CrossRef

22.

Wu Y., Yue Q., Zhu X., Yang S.: Weight enumerators of reducible cyclic codes and their dual codes. Discret. Math. 342, 671–682 (2019).MathSciNetCrossRef

23.

Wu Y., Zhu X., Yue Q.: Optimal few-weight codes from simplicial complexes. IEEE Trans. Inf. Theory 66(6), 3657–3663 (2020).MathSciNetCrossRef

Titel: Optimal minimal linear codes from posets
verfasst von: Jong Yoon Hyun
Hyun Kwang Kim
Yansheng Wu
Qin Yue
Publikationsdatum: 11.09.2020
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 12/2020
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-020-00793-0

Springer Professional

Optimal minimal linear codes from posets

Abstract

Premium Partner

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Weitere Artikel der Ausgabe 12/2020

A polymatroid approach to generalized weights of rank metric codes

Maximal nonassociativity via fields

Construction of isodual codes from polycirculant matrices

Wide-sense 2-frameproof codes

Two families of two-weight codes over

Rédei permutations with cycles of the same length

Premium Partner