Efficient decoding of some classes of binary cyclic codes beyond the Hartmann-Tzeng bound

Alexander Zeh, Antonia Wachter, Sergey Bezzateev

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

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.

Original languageEnglish
Title of host publication2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Pages1017-1021
Number of pages5
DOIs
StatePublished - 2011
Externally publishedYes
Event2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 - St. Petersburg, Russian Federation
Duration: 31 Jul 20115 Aug 2011

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8104

Conference

Conference2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Country/TerritoryRussian Federation
CitySt. Petersburg
Period31/07/115/08/11

Keywords

  • Binary BCH Code
  • Binary Cyclic Code
  • Bound on the Minimum Distance
  • Efficient Decoding

Fingerprint

Dive into the research topics of 'Efficient decoding of some classes of binary cyclic codes beyond the Hartmann-Tzeng bound'. Together they form a unique fingerprint.

Cite this