eCite Digital Repository

Minimum Distances of Error-Correcting Codes in Incidence Rings


Kelarev, AV, Minimum Distances of Error-Correcting Codes in Incidence Rings, International Journal of Mathematics and Mathematical Sciences, 2003, (13) pp. 827-833. ISSN 0161-1712 (2003) [Refereed Article]

DOI: doi:10.1155/S0161171203204063


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. All rights reserved.

Item Details

Item Type:Refereed Article
Research Division:Mathematical Sciences
Research Group:Pure mathematics
Research Field:Algebra and number theory
Objective Division:Expanding Knowledge
Objective Group:Expanding knowledge
Objective Field:Expanding knowledge in the mathematical sciences
UTAS Author:Kelarev, AV (Dr Andrei Kelarev)
ID Code:27035
Year Published:2003
Deposited By:Mathematics
Deposited On:2003-08-01
Last Modified:2004-04-20

Repository Staff Only: item control page