Learn More
M ANY lower bounds exist for the minimum Hamming distance of cyclic codes, among others the BCH [2], Hartmann-Tzeng [3], and Roos [4] bounds. They are usually based on patterns in the complete defining set of the code. We present a similar bound, which is based on a pattern which has never been noted before. Our lower bound is stronger than the BCH bound,(More)
— In this paper a new lower bound for the distance of cyclic codes is proposed. This bound depends on the defining set of the code, like several other bounds. Moreover it is stronger than the BCH bound, but not stronger than the HT bound, yet it is not weaker than the Roos bound. I. INTRODUCTION Many lower bounds exist for the distance of cyclic codes,(More)
  • 1