Boolean functions for cryptography and coding theory
C Carlet - 2021 - books.google.com
Boolean functions are essential to systems for secure and reliable communication. This
comprehensive survey of Boolean functions for cryptography and coding covers the whole …
comprehensive survey of Boolean functions for cryptography and coding covers the whole …
[图书][B] Concise encyclopedia of coding theory
Most coding theory experts date the origin of the subject with the 1948 publication of A
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …
Several classes of minimal linear codes with few weights from weakly regular plateaued functions
S Mesnager, A Sınak - IEEE Transactions on Information …, 2019 - ieeexplore.ieee.org
Minimal linear codes have significant applications in secret sharing schemes and secure
two-party computation. There are several methods to construct linear codes, one of which is …
two-party computation. There are several methods to construct linear codes, one of which is …
[HTML][HTML] Linear cutting blocking sets and minimal codes in the rank metric
This work investigates the structure of rank-metric codes in connection with concepts from
finite geometry, most notably the q-analogues of projective systems and blocking sets. We …
finite geometry, most notably the q-analogues of projective systems and blocking sets. We …
Minimal linear codes arising from blocking sets
Minimal linear codes are algebraic objects which gained interest in the last 20 years, due to
their link with Massey's secret sharing schemes. In this context, Ashikhmin and Barg …
their link with Massey's secret sharing schemes. In this context, Ashikhmin and Barg …
Linear codes from weakly regular plateaued functions and their secret sharing schemes
Linear codes, the most significant class of codes in coding theory, have diverse applications
in secret sharing schemes, authentication codes, communication, data storage devices and …
in secret sharing schemes, authentication codes, communication, data storage devices and …
A geometric characterization of minimal codes and their asymptotic performance
In this paper, we give a geometric characterization of minimal linear codes. In particular, we
relate minimal linear codes to cutting blocking sets, introduced in a recent paper by Bonini …
relate minimal linear codes to cutting blocking sets, introduced in a recent paper by Bonini …
Full characterization of minimal linear codes as cutting blocking sets
C Tang, Y Qiu, Q Liao, Z Zhou - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
In this paper, we first study in detail the relationship between minimal linear codes and
cutting blocking sets, recently introduced by Bonini and Borello, and then completely …
cutting blocking sets, recently introduced by Bonini and Borello, and then completely …
Ternary self-orthogonal codes from weakly regular bent functions and their application in LCD Codes
Z Heng, D Li, F Liu - Designs, Codes and Cryptography, 2023 - Springer
Self-orthogonal codes are linear codes such that they are contained in their duals. Self-
orthogonal codes have attracted much attention due to their applications in linear …
orthogonal codes have attracted much attention due to their applications in linear …
Minimal linear codes in odd characteristic
Minimal Linear Codes in Odd Characteristic Page 1 4152 IEEE TRANSACTIONS ON
INFORMATION THEORY, VOL. 65, NO. 7, JULY 2019 Minimal Linear Codes in Odd Characteristic …
INFORMATION THEORY, VOL. 65, NO. 7, JULY 2019 Minimal Linear Codes in Odd Characteristic …