The Ashikhmin-Barg bound

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 …

Wide minimal binary linear codes from the general Maiorana–McFarland class

Minimal linear codes form a special class of linear codes that have important applications in secret sharing and secure two-party computation. These codes are characterized by the property that linearly independent codewords do not cover each other. …