Journal ArticleDOI
A note on decoding of block codes (Corresp.)
TLDR
It is shown that the proposed decoding scheme can be applied to several BCH codes making it possible to correct many errors beyond the ones guaranteed by the known minimum distance and also the codes will be "effectively" majority decodable.Abstract:
A decoding scheme is given for some block codes for which it is known how to decode a subcode. It is shown that the proposed decoding scheme can be applied to several BCH codes making it possible to correct many errors beyond the ones guaranteed by the known minimum distance and also the codes will be "effectively" majority decodable.read more
Citations
More filters
Journal ArticleDOI
Augmentation techniques for a class of product codes
TL;DR: A class of product codes for which an augmented syndrome can be defined is studied and it is seen that in certain cases, by choosing not to correct a small number of correctable errors, significant simplifications in the decoder can be achieved.
Journal ArticleDOI
A survey of coding theory: 1967-1972
TL;DR: The coding theory literature for the period 1967-1972 is surveyed and a brief description of several books solely concerned with coding theory is presented.
References
More filters
Journal ArticleDOI
New generalizations of the Reed-Muller codes--I: Primitive codes
TL;DR: A natural generalization to the nonbinary case is presented, which also includes the Reed-Muller codes and Reed-Solomon codes as special cases and the generator polynomial is characterized and the minimum weight is established.
Journal ArticleDOI
An optimum nonlinear code
Alan W. Nordstrom,J.P. Robinson +1 more
TL;DR: A systematic nonlinear code having length 15, minimum distance 5, and 256 code words is given in Boolean form, which is the maximum possible number of words for length 15 and distance 5.
Journal ArticleDOI
New generalizations of the Reed-Muller codes--II: Nonprimitive codes
TL;DR: A class of nonprimitive cyclic codes quite similar in structure to the original Reed-Muller codes is presented, and it is shown that for given values of code length and rate the codes have relatively large minimum distances.