International Journal of Mathematics and Mathematical Sciences

International Journal of Mathematics and Mathematical Sciences / 2003 / Article

Open Access

Volume 2003 |Article ID 459482 | https://doi.org/10.1155/S0161171203204063

A. V. Kelarev, "Minimum distances of error-correcting codes in incidence rings", International Journal of Mathematics and Mathematical Sciences, vol. 2003, Article ID 459482, 7 pages, 2003. https://doi.org/10.1155/S0161171203204063

Minimum distances of error-correcting codes in incidence rings

Received07 Apr 2002

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.

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.


More related articles

 PDF Download Citation Citation
 Order printed copiesOrder
Views76
Downloads409
Citations

We are committed to sharing findings related to COVID-19 as quickly as possible. We will be providing unlimited waivers of publication charges for accepted research articles as well as case reports and case series related to COVID-19. Review articles are excluded from this waiver policy. Sign up here as a reviewer to help fast-track new submissions.