• DocumentCode
    54056
  • Title

    New Families of Codebooks Achieving the Levenstein Bound

  • Author

    Zhengchun Zhou ; Cunsheng Ding ; Nian Li

  • Author_Institution
    Sch. of Math., Southwest Jiaotong Univ., Chengdu, China
  • Volume
    60
  • Issue
    11
  • fYear
    2014
  • fDate
    Nov. 2014
  • Firstpage
    7382
  • Lastpage
    7387
  • Abstract
    In this paper, a construction of codebooks based on a set of bent functions satisfying certain conditions is introduced. It includes some earlier constructions of codebooks meeting the Levenstein bound as special cases. With this construction, two new families of codebooks achieving the Levenstein bound are obtained. The codebooks constructed in this paper could have a very small alphabet size.
  • Keywords
    encoding; functions; Levenstein bound; bent functions; codebooks; small alphabet size; Correlation; Educational institutions; Electronic mail; Equations; Indexes; Vectors; Codebook; Levenstein bound; bent function; packing; signal set;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2014.2353052
  • Filename
    6891237
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=54056