A sequence of one-point codes from a tower of function fields

Takehiro Hasegawa, Shoichi Kondo, Hidekazu Kurusu

    Research output: Contribution to journalArticle

    3 Citations (Scopus)

    Abstract

    We construct a sequence of one-point codes from a tower of function fields whose relative minimum distances have a positive limit. Our tower is characterized by principal divisors. We determine completely the minimum distance of the codes from the first field of our tower. These results extend those of Stichtenoth [IEEE Trans Inform Theory (1988), 34(15):1345-1348], Yang and Kumar [Lecture Notes in Mathematics, 1518, (1991), Springer-Verlag, Berlin Hidelberg New York, pp. 99-107], and Garcia [Comm. Algebra, 20(12): 3683-3689]. As an application, we show that the minimum distance corresponds to the Feng-Rao bound.

    Original languageEnglish
    Pages (from-to)251-267
    Number of pages17
    JournalDesigns, Codes, and Cryptography
    Volume41
    Issue number3
    DOIs
    Publication statusPublished - 2006 Dec

    Fingerprint

    Function Fields
    Minimum Distance
    Towers
    Divisor
    Algebra

    Keywords

    • Feng-Rao bound
    • Minimum distance
    • One-point code
    • Tower of function fields

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computational Theory and Mathematics
    • Applied Mathematics

    Cite this

    A sequence of one-point codes from a tower of function fields. / Hasegawa, Takehiro; Kondo, Shoichi; Kurusu, Hidekazu.

    In: Designs, Codes, and Cryptography, Vol. 41, No. 3, 12.2006, p. 251-267.

    Research output: Contribution to journalArticle

    Hasegawa, Takehiro ; Kondo, Shoichi ; Kurusu, Hidekazu. / A sequence of one-point codes from a tower of function fields. In: Designs, Codes, and Cryptography. 2006 ; Vol. 41, No. 3. pp. 251-267.
    @article{d70b350b326d4120b1cf8b9fbc88ef21,
    title = "A sequence of one-point codes from a tower of function fields",
    abstract = "We construct a sequence of one-point codes from a tower of function fields whose relative minimum distances have a positive limit. Our tower is characterized by principal divisors. We determine completely the minimum distance of the codes from the first field of our tower. These results extend those of Stichtenoth [IEEE Trans Inform Theory (1988), 34(15):1345-1348], Yang and Kumar [Lecture Notes in Mathematics, 1518, (1991), Springer-Verlag, Berlin Hidelberg New York, pp. 99-107], and Garcia [Comm. Algebra, 20(12): 3683-3689]. As an application, we show that the minimum distance corresponds to the Feng-Rao bound.",
    keywords = "Feng-Rao bound, Minimum distance, One-point code, Tower of function fields",
    author = "Takehiro Hasegawa and Shoichi Kondo and Hidekazu Kurusu",
    year = "2006",
    month = "12",
    doi = "10.1007/s10623-006-9013-x",
    language = "English",
    volume = "41",
    pages = "251--267",
    journal = "Designs, Codes, and Cryptography",
    issn = "0925-1022",
    publisher = "Springer Netherlands",
    number = "3",

    }

    TY - JOUR

    T1 - A sequence of one-point codes from a tower of function fields

    AU - Hasegawa, Takehiro

    AU - Kondo, Shoichi

    AU - Kurusu, Hidekazu

    PY - 2006/12

    Y1 - 2006/12

    N2 - We construct a sequence of one-point codes from a tower of function fields whose relative minimum distances have a positive limit. Our tower is characterized by principal divisors. We determine completely the minimum distance of the codes from the first field of our tower. These results extend those of Stichtenoth [IEEE Trans Inform Theory (1988), 34(15):1345-1348], Yang and Kumar [Lecture Notes in Mathematics, 1518, (1991), Springer-Verlag, Berlin Hidelberg New York, pp. 99-107], and Garcia [Comm. Algebra, 20(12): 3683-3689]. As an application, we show that the minimum distance corresponds to the Feng-Rao bound.

    AB - We construct a sequence of one-point codes from a tower of function fields whose relative minimum distances have a positive limit. Our tower is characterized by principal divisors. We determine completely the minimum distance of the codes from the first field of our tower. These results extend those of Stichtenoth [IEEE Trans Inform Theory (1988), 34(15):1345-1348], Yang and Kumar [Lecture Notes in Mathematics, 1518, (1991), Springer-Verlag, Berlin Hidelberg New York, pp. 99-107], and Garcia [Comm. Algebra, 20(12): 3683-3689]. As an application, we show that the minimum distance corresponds to the Feng-Rao bound.

    KW - Feng-Rao bound

    KW - Minimum distance

    KW - One-point code

    KW - Tower of function fields

    UR - http://www.scopus.com/inward/record.url?scp=33751528049&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=33751528049&partnerID=8YFLogxK

    U2 - 10.1007/s10623-006-9013-x

    DO - 10.1007/s10623-006-9013-x

    M3 - Article

    VL - 41

    SP - 251

    EP - 267

    JO - Designs, Codes, and Cryptography

    JF - Designs, Codes, and Cryptography

    SN - 0925-1022

    IS - 3

    ER -