• DocumentCode
    3770449
  • Title

    The computational complexity of some algorithms for the rank bounded distance on cyclic codes

  • Author

    Junru Zheng;Takayasu Kaiday

  • Author_Institution
    Faculty of Humanities, Kyushu Women´s University, Kitakyushu, Fukuoka, Japan
  • fYear
    2015
  • Firstpage
    38
  • Lastpage
    41
  • Abstract
    The authors proposed an algorithm for calculation of new lower bound using the discrete Fourier transform in 2010. Afterward, we considered some algorithms to improve the original algorithm. In this paper, we discuss the computational complexity of the rank bounded distance for cyclic codes.
  • Keywords
    "Computational complexity","Discrete Fourier transforms","Zinc","Algorithm design and analysis","Hamming weight"
  • Publisher
    ieee
  • Conference_Titel
    Signal Design and its Applications in Communications (IWSDA), 2015 Seventh International Workshop on
  • Electronic_ISBN
    2150-3699
  • Type

    conf

  • DOI
    10.1109/IWSDA.2015.7458409
  • Filename
    7458409
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3770449