New bounds on the minimum distance of cyclic codes

Ling S., ÖZKAYA B.

Advances in Mathematics of Communications, vol.15, no.1, pp.1-8, 2021 (SCI-Expanded) identifier

  • Publication Type: Article / Article
  • Volume: 15 Issue: 1
  • Publication Date: 2021
  • Doi Number: 10.3934/amc.2020038
  • Journal Name: Advances in Mathematics of Communications
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Applied Science & Technology Source, MathSciNet, zbMATH
  • Page Numbers: pp.1-8
  • Keywords: Cyclic codes, Minimum distance bound, Product code, Roos bound
  • Middle East Technical University Affiliated: No

Abstract

Two bounds on the minimum distance of cyclic codes are proposed. The first one generalizes the Roos bound by embedding the given cyclic code into a cyclic product code. The second bound also uses a second cyclic code, namely the non-zero-locator code, but is not directly related to cyclic product codes and it generalizes a special case of the Roos bound.