|
Organizers |
On self-complementary codes
by
Stefan Dodunekov
Institute of Mathematics and Informatics, Bulgarian Academy of Sciences
In the first part of this survey talk we will give some characterization results about binary self-complementary codes meeting the Grey-Rankin bound. In the second part we will consider some recent q-ary versions of the Grey-Rankin bound and will describe explicite constructions of codes meeting these bounds.
Date received: February 28, 2008
Copyright © 2008 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cawu-46.