IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-56755-1_20.html
   My bibliography  Save this book chapter

On Binary Cyclic Codes With Few Weights

In: Finite Fields and Applications

Author

Listed:
  • Henk D. L. Hollmann

    (Philips Research Laboratories)

  • Qing Xiang

    (University of Delaware, Department of Mathematical Sciences)

Abstract

Let $$ {C_{{{t_{0}}}}}{,_{{{t_{1}}...,{t_{r}}}}} $$ denote the binary cyclic code of length n = 2 m − 1 with defining zeros $$ {\alpha ^{{{t_{0}}}}},{\alpha ^{{{t_{1}}}}}...,{a^{{{t_{r}}}}} $$ , where α is a primitive element of GF(2 m ). Using the method in [8], we determine the weight distribution of the following cyclic codes. (i) $$ {C_{{1,{t_{1}},{t_{2}}}}}, $$ , where m = 2r + 1, t 1 = 2r + 1, t 2 = 2 r−1 + 1. (This code appeared in Research Problem 9.7 of MacWilhams and Sloane [14].) (ii) $$ {C_{{1,t,{t^{2}}}}}, $$ where m = 2r + l, t = l + 22r+1 (This code appeared in a conjecture of Chang, Gaal, Golomb, Gong, and Kumar [5].) (iii) Several cyclic codes in the paper of Van Lint and Wilson [12]. (iv) C 1,t, where $$ m = 2r,t = \sum\nolimits_{{i = 0}}^{r} {{2^{{ik}}}} $$ , gcd(m, k) = 1.

Suggested Citation

  • Henk D. L. Hollmann & Qing Xiang, 2001. "On Binary Cyclic Codes With Few Weights," Springer Books, in: Dieter Jungnickel & Harald Niederreiter (ed.), Finite Fields and Applications, pages 251-275, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-56755-1_20
    DOI: 10.1007/978-3-642-56755-1_20
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-642-56755-1_20. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.