A note on binary completely regular codes with large minimum distance

Neil Gillespie

    Research output: Contribution to journalArticlepeer-review

    1 Citation (Scopus)

    Abstract

    We classify all binary error correcting completely regular codes of length n with minimum distance δ>n/2. © 2013 Elsevier B.V. All rights reserved.
    Original languageEnglish
    Pages (from-to)1532-1534
    JournalDiscrete Mathematics
    Volume313
    Issue number14
    DOIs
    Publication statusPublished - 2013

    Fingerprint

    Dive into the research topics of 'A note on binary completely regular codes with large minimum distance'. Together they form a unique fingerprint.

    Cite this