Minimum distances of error-correcting codes in incidence rings

A. V. Kelarev

International Journal of Mathematics and Mathematical Sciences, 2003, vol. 2003, 1-7

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.

Date: 2003
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2003/459482.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2003/459482.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:459482

DOI: 10.1155/S0161171203204063

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().