Reed Muller codes

Reed Muller codes Reed-Muller codes form impotrant class of cyclic multiple-error-correction codes. For any integers p and r , with , there exists a binary RM code of the r -th order, denoted as RM( r , p ), with the following parameters:
block-length: , length of information word: , minimum distance: . Then, RM( r , p ) code corrects all errors up to errors.
Codewords can be determined by means of the generator matrix, its construction is described by the following algorithm.
... zobacz całą notatkę