Abstract
The main theorem of this paper gives a formula for the largest minimum distance of error-correcting codes considered as ideals in incidence rings defined by directed graphs.
Open Access
Minimum distances of error-correcting codes in incidence rings
Received07 Apr 2002
Copyright
Copyright © 2003 Hindawi Publishing Corporation. This is an open access article distributed under the
Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.