Abstract

Primitive binary BCH-codes were supposed to have binomial weight distributions for all code rates R/spl les/1 when N/spl rarr//spl infin/. It is shown that this is only true if R/spl rarr/1.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call