DocumentCode
2454959
Title
On Shift Bound for Cyclic Codes by DFT with Unknown Elements
Author
Zheng, Junru ; Kaida, Takayasu
Author_Institution
Kyushu Kyoritsu Univ., Fukuoka
fYear
2007
fDate
23-27 Sept. 2007
Firstpage
114
Lastpage
117
Abstract
The shift bound is a good lower bound of the minimum distance for cyclic codes, Reed-Muller codes and geometric Goppa codes. In this paper we consider cyclic codes defined by defining sequence and new simple derivation using the discrete Fourier transform with unknown elements and the Blahut theorem is shown. Moreover two examples of binary cyclic codes are given.
Keywords
Goppa codes; block codes; cyclic codes; discrete Fourier transforms; geometric codes; Blahut theorem; DFT; Reed-Muller codes; binary cyclic codes; discrete Fourier transform; geometric Goppa codes; shift bound; Decoding; Discrete Fourier transforms; Galois fields; Hamming weight; Information science; Linear code; Zinc; Blahut theorem; cyclic code; discrete Fourier transform; lower bound; minimum distance;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Design and Its Applications in Communications, 2007. IWSDA 2007. 3rd International Workshop on
Conference_Location
Chengdu
Print_ISBN
978-1-4244-1074-3
Electronic_ISBN
978-1-4244-1074-3
Type
conf
DOI
10.1109/IWSDA.2007.4408337
Filename
4408337
Link To Document