Title :
On a class of wide-sense binary BCH codes whose minimum distances exceed the BCH bound (Corresp.)
fDate :
9/1/1968 12:00:00 AM
Keywords :
BCH codes; Communications technology; Difference equations; Euclidean distance; Mathematical model; Polynomials; Probability density function; Sufficient conditions;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1968.1054206
