Hi, For a binary cyclic code with a generator g(x), the minimum hamming distance of the code is determined by the weight of g(x). Is this also true for non-binary cyclic codes like Reed-Solomon? Your time, effort and suggestions will be much appreciated Jaco
Minimum weight of a cyclic code determined by the generator polynomial?
Started by ●September 19, 2003
Reply by ●September 19, 20032003-09-19
Jaco Versfeld wrote:> > Hi, > > For a binary cyclic code with a generator g(x), the minimum hamming > distance of the code is determined by the weight of g(x). > > Is this also true for non-binary cyclic codes like Reed-Solomon?It is true statement for any linear code.> Your time, effort and suggestions will be much appreciatedThat is too much for me. Just $100 would be enough :) Vladimir Vassilevsky DSP and Mixed Signal Design Consultant http://www.abvolt.com