Root Boolean function

Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound

Minimal binary linear codes are a special class of binary codes with important applications in secret sharing and secure two-party computation. These codes are characterized by the property that none of the nonzero codewords is covered by any other …