Reed–Muller code: Difference between revisions

Revision as of 21:10, 5 July 2019

Revision as of 22:10, 7 August 2019

Line 77:

{{Confusing section|date=March 2011|reason=this section uses dense notation that is not explained well for most readers}}

A [[generator matrix]] for a Reed–Muller code {{nowrap|RM(''r'', ''m'')}} of length {{nowrap|1=''N'' = 2^''m''}} can be constructed as follows. Let us write the set of all ''m''-dimensional binary vectors as:

:<math> X = \mathbb{F}_2^m = \{ x_1, \ldots, x_{N} \}. </math>