University of Tasmania
Browse

Minimum Distances of Error-Correcting Codes in Incidence Rings

Version 2 2024-09-17, 02:05
Version 1 2023-05-16, 14:15
journal contribution
posted on 2024-09-17, 02:05 authored by AV Kelarev
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.

History

Publication title

International Journal of Mathematics and Mathematical Sciences

Volume

2003

Issue

13

Pagination

827-833

ISSN

0161-1712

Department/School

Mathematics

Publisher

Hindawi Publishing Corporation

Publication status

  • Published

Place of publication

USA

Socio-economic Objectives

280118 Expanding knowledge in the mathematical sciences

Usage metrics

    University Of Tasmania

    Categories

    Keywords

    No keyword provided

    Licence

    In Copyright

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC