• DocumentCode
    3125847
  • Title

    Greedy codes over Z4

  • Author

    Guenda, Kenza ; Gulliver, T. Aaron ; Sheikholeslam, S. Arash

  • Author_Institution
    Fac. of Math. USTHB, Univ. of Sci. & Technol. of Algiers, Algiers, Algeria
  • fYear
    2012
  • fDate
    1-6 July 2012
  • Firstpage
    3106
  • Lastpage
    3109
  • Abstract
    In this paper, we consider the construction of lexi-codes by using a B-ordering over the ring Z4. This algorithm can be applied to any multiplicative property over Z4. It is shown that this construction produces many optimal codes over Z4 and also good binary codes.
  • Keywords
    binary codes; ℤ4 greedy code; B-ordering; binary code; lexi-code construction; multiplicative property; optimal code; Binary codes; Cryptography; Greedy algorithms; Lattices; Linear code; Linearity; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on
  • Conference_Location
    Cambridge, MA
  • ISSN
    2157-8095
  • Print_ISBN
    978-1-4673-2580-6
  • Electronic_ISBN
    2157-8095
  • Type

    conf

  • DOI
    10.1109/ISIT.2012.6284135
  • Filename
    6284135
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3125847