DCC
2001
IEEE
15 years 1 days ago
2001
IEEE
DCC
2001
IEEE
15 years 1 days ago
2001
IEEE
In this paper, a Legendre sequence of period p for any odd prime p is explicitely represented as a sum of trace functions from GF(2n) to GF(2), where n is the order of 2 mod p.
DCC
2001
IEEE
15 years 1 days ago
2001
IEEE
Recently, and contrary to the common belief, Rivest and Silverman argued that the use of strong primes is unnecessary in the RSA cryptosystem. This paper analyzes how valid this as...
DCC
2001
IEEE
15 years 1 days ago
2001
IEEE
The multicovering radii of a code are recent generalizations of the covering radius of a code. For positive m, the m-covering radius of C is the least radius t such that every m-tu...
DCC
2001
IEEE
15 years 1 days ago
2001
IEEE
We construct large caps in projective spaces of small dimension (up to 11) defined over fields of order at most 9. The constructions are both theoretical and computer-supported. S...
DCC
2001
IEEE
15 years 1 days ago
2001
IEEE
DCC
2001
IEEE
15 years 1 days ago
2001
IEEE
A method for demonstrating and enumerating uniformly efficient (permutation-optimal) trellis decoders for self-dual codes of high minimum distance is developed. Such decoders and c...
DCC
2001
IEEE
15 years 1 days ago
2001
IEEE
DCC
2001
IEEE
15 years 1 days ago
2001
IEEE
In this paper, we study binary optimal odd formally self-dual codes. All optimal odd formally self-dual codes are classified for length up to 16. The highest minimum weight of any ...