Well-ordered steiner triple systems and 1-perfect partitions of the N-cube

    Research output: Contribution to journalArticleResearchpeer-review

    10 Citations (Scopus)

    Abstract

    Binary 1-perfect codes which give rise to partitions of the n-cube are presented. The 1-perfect partitions are characterized as homomorphic images of simple algebraic structures on Fn and are constructed starting from a particular case of a structure defined in Fn. A special property (so-called well-ordering) of STS(n) is given in such a way that for this kind of STS it is possible to define the algebraic structure we need in Fn and to construct 1-perfect partitions of the n-cube. These 1-perfect partitions give us a kind of 1-perfect code for which it is easy to do the coding and decoding. Furthermore, there exists a syndrome which allows us to perform error correction. We present systematic codes of length n = 15 and we give examples of how to do the coding, decoding, and error correction. © 1999 Society for Industrial and Applied Mathematics.
    Original languageEnglish
    Pages (from-to)35-47
    JournalSIAM Journal on Discrete Mathematics
    Volume12
    Issue number1
    DOIs
    Publication statusPublished - 1 Jan 1999

    Keywords

    • 1-perfect binary codes
    • 1-perfect partitions
    • Distance-compatible action
    • Sloops
    • Steiner triple systems

    Fingerprint Dive into the research topics of 'Well-ordered steiner triple systems and 1-perfect partitions of the N-cube'. Together they form a unique fingerprint.

    Cite this