Let n (>3) be a prime number and F_2^n a finite field of 2^n
elements. L...
Goppa codes are particularly appealing for cryptographic applications. E...
Self-dual maximum distance separable codes (self-dual MDS codes) and
sel...
The Doob graph D(m,n) is the Cartesian product of m>0 copies of the
Shri...
This paper investigates the existence, enumeration and asymptotic perfor...