For an ( n, M, d)-code C over F q, theoretically we would like both ( C) = (log q M)/ n and ?( C) = ( d ? 1)/ n to be as large as possible. In other words, we want M to be as large as possible for ...

Since a linear code is a vector space, all its elements can be described in terms of a basis. In this section, we discuss three algorithms that yield either a basis for a given linear code or its dual ...

Code-based cryptography employs error-correcting codes as the basis for secure public-key schemes, leveraging the intrinsic difficulty of decoding a random linear ...