- Bar product (coding theory)
In
information theory , the bar product of twolinear code s "C"2 ⊆ "C"1 is defined as:,
where ("a"|"b") denotes the concatenation of "a" and "b". If the
code word s in "C"1 are of length "n", then the code words in "C"1|"C"2 are of length 2"n".The bar product is an especially convenient way of expressing the Reed-Muller RM ("d", "r") code in terms of the Reed-Muller codes RM ("d" − 1, "r") and RM ("d" − 1, "r" − 1).
The bar product is also referred to as the |"u"|"u"+"v"| construction [cite book | author=F.J. MacWilliams | authorlink=Jessie MacWilliams | coauthors=N.J.A. Sloane | title=The Theory of Error-Correcting Codes | publisher=North-Holland | date=1977 | isbn=0-444-85193-3 | page=76 ] or ("u"|"u"+"v") construction [cite book | author=J.H. van Lint | title=Introduction to Coding Theory | edition=2nd ed | publisher=
Springer-Verlag | series=GTM | volume=86 | date=1992 | isbn=3-540-54894-7 | page=47 ] .Properties
Rank
The rank of the bar product is the sum of the two ranks:
:
Proof
Let be a basis for and let be a basis for . Then the set
is a basis for the bar product .
Hamming weight
The
Hamming weight "w" of the bar product is the lesser of (a) twice the weight of "C"1, and (b) the weight of "C"2::
Proof
For all ,
:
which has weight . Equally
:
for all and has weight . So minimising over we have
:
Now let and , not both zero. If then::If then:
so
:
ee also
*
Reed-Muller code References
Wikimedia Foundation. 2010.