Efficient Decoding of Some Classes of Binary Cyclic
Codes beyond the Hartmann--Tzeng Boundde
Efficient Decoding of Some Classes of Binary Cyclic Codes Beyond the Hartmann-Tzeng Bound

Titel:: Efficient Decoding of Some Classes of Binary Cyclic Codes beyond the Hartmann--Tzeng Boundde Efficient Decoding of Some Classes of Binary Cyclic Codes Beyond the Hartmann-Tzeng Bound
Dokumenttyp:: Konferenzbeitrag
Autor(en):: Zeh, A.; Wachter, A.; Bezzateev, S.
Abstract:: A new bound on the distance of binary cyclic codes is proposed. The approach is based on the representation of a subset of the roots of the generator polynomial by a rational function. A new bound on the minimum distance is proven and several classes of binary cyclic codes are identified. For some classes of codes, this bound is better than the known bounds (e.g. BCH or Hartmann-Tzeng bound). Furthermore, a quadratic-time decoding algorithm up to this new bound is developed.
Kongress- / Buchtitel:: IEEE Int. Symp. Inf. Theory (ISIT)
Jahr:: 2011
Monat:: Aug
Seiten:: 1017--1021
BibTeX

Vorkommen: