Login / Signup
A huge class of infinite sequences of minimal binary linear codes with or without crossing the Ashikhmin-Barg's bound.
Fengrong Zhang
Enes Pasalic
René Rodríguez
Yongzhuang Wei
Published in:
IACR Cryptol. ePrint Arch. (2020)
Keyphrases
</>
upper bound
finite dimensional
linear functions
binary valued
error correcting
sufficient conditions
sequential patterns
error correction
finite number
inductive inference
grammatical inference
error correcting codes
regular languages
logical operations