Journal Menu

Abstracting and Indexing
Aims and Scope
Article Processing Charges
Author Guidelines
Bibliographic Information
Contact Information
Editorial Board
Editorial Workflow
Reviewers Acknowledgment
Subscription Information

Abstract
Full-Text PDF

International Journal of Mathematics and Mathematical Sciences
Volume 2003 (2003), Issue 13, Pages 827-833
doi:10.1155/S0161171203204063

Minimum distances of error-correcting codes in incidence rings

A.V. Kelarev

Department of Mathematics, School of Mathematics and Physics, University of Tasmania, GPO Box 252-37, Hobart 7001, Tasmania, Australia

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.