Hadamard Code Sec B Wireless Assignment
Hadamard Code Sec B Wireless Assignment
1|Page
Generalized Hadamard codes:
• The Hadamard codes are relatively easy to decode; they are the first
length 2^k .
2|Page
• This gives rise to applications in computational complexity theory and
particularly in the design of probabilistically checkable proofs.
Since the relative distance of the Hadamard code is 1/2, normally one can
only hope to recover from at most a 1/4 fraction of error.
𝐻 𝐻
If H is a Hadamard matrix of order n, then [ ]is a
𝐻 −𝐻
Hadamard matrix of order 2n.
3|Page
The Hadamard Code Generator block outputs a row of H . The
output is bipolar.
0’s such that each row differs from any other row in
SOURCE:
http://www.math.cuden.edu/~wcherowi/courses/m6409/mar iner9talk.pdf