DocumentCode :
3405395
Title :
On relationship between proposed lower bound and shift bound for cyclic codes
Author :
Zheng, Junru ; Kaida, Takayasu
Author_Institution :
Dept. of Humanities, Kyushu Women´´s Univ., Kitakyushu, Japan
fYear :
2011
fDate :
10-14 Oct. 2011
Firstpage :
13
Lastpage :
16
Abstract :
For cyclic codes we proposed a new lower bound of minimum distance by discrete Fourier transform (DFT). In this paper, we will show relationships between the proposed bound and the shift bound by numerical experiments. Moreover, the computational complexity of proposed lower bound is compared with the shift bound.
Keywords :
cyclic codes; discrete Fourier transforms; cyclic codes; discrete Fourier transform; lower bound; shift bound; Computational complexity; Discrete Fourier transforms; Educational institutions; Hamming weight; Zinc; Lower bound; cyclic code; discrete Fourier transform; minimum distance; shift bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Signal Design and its Applications in Communications (IWSDA), 2011 Fifth International Workshop on
Conference_Location :
Guilin
Print_ISBN :
978-1-61284-047-5
Type :
conf
DOI :
10.1109/IWSDA.2011.6159405
Filename :
6159405
Link To Document :
بازگشت