Title :
Describing a cyclic code by another cyclic code
Author :
Zeh, Alexander ; Bezzateev, Sergey
Author_Institution :
Inst. of Commun. Eng., Univ. of Ulm, Ulm, Germany
Abstract :
A new approach to bound the minimum distance of q-ary cyclic codes is presented. The connection to the BCH and the Hartmann-Tzeng bound is formulated and it is shown that for several cases an improvement is achieved. We associate a second cyclic code to the original one and bound its minimum distance in terms of parameters of the associated code.
Keywords :
BCH codes; cyclic codes; BCH bound; Hartmann-Tzeng bound; minimum parameter distance; q-ary cyclic code; Decoding; Educational institutions; Generators; Indexes; Parity check codes; Polynomials; BCH Bound; Cyclic Code; Hartmann-Tzeng Bound;
Conference_Titel :
Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
978-1-4673-2580-6
Electronic_ISBN :
2157-8095
DOI :
10.1109/ISIT.2012.6284054
