IJPAM: Volume 46, No. 2 (2008)

Invited Lecture Delivered at
Forth International Conference of Applied Mathematics
and Computing (Plovdiv, Bulgaria, August 12-18, 2007)


Martin Dowd
1613 Wintergreen Pl.
Costa Mesa, CA 92626, USA
e-mail: MartDowd@aol.com

Abstract.Some theorems are proved about configurations in binary linear codes. A conjecture is made about configurations in linear double error correcting codes, which would lead to an upper bound, better by a constant factor than the sphere packing bound.

Received: August 17, 2007

AMS Subject Classification: 94B05

Key Words and Phrases: linear double error correcting codes, sphere packing bound

Source: International Journal of Pure and Applied Mathematics
ISSN: 1311-8080
Year: 2008
Volume: 46
Issue: 2