DocumentCode :
2573418
Title :
On Boston bound for cyclic codes by DFT with unknown elements
Author :
Zheng, Junru ; Kaida, Takayasu
Author_Institution :
Dept. of Humanities, Kyushu Women´´s Univ., Kitakyushu, Japan
fYear :
2009
fDate :
19-23 Oct. 2009
Firstpage :
108
Lastpage :
111
Abstract :
The Boston bound is defined by the subset of defining set for cyclic codes. The authors proposed new simple derivation for the BCH bound, the HT bound and the shift bound, using the discrete Fourier transform (DFT) and the Blahut theorem. In this paper, we consider the Boston bound for cyclic codes by the DFT.
Keywords :
cyclic codes; discrete Fourier transforms; set theory; BCH bound; Blahut theorem; Boston bound; DFT; cyclic code; discrete Fourier transform; Decoding; Discrete Fourier transforms; Galois fields; Linear code; Polynomials; Blahut theorem; Boston bound; cyclic code; discrete Fourier transform; minimum distance;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Signal Design and its Applications in Communications, 2009. IWSDA '09. Fourth International Workshop on
Conference_Location :
Fukuoka
Print_ISBN :
978-1-4244-4379-6
Electronic_ISBN :
978-1-4244-4380-2
Type :
conf
DOI :
10.1109/IWSDA.2009.5346404
Filename :
5346404
Link To Document :
بازگشت