SAMARA UNIVERSITY
COLLEGE OF ENGINEERING AND TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE
COURSE TITLE: WIRELESS COMMUNICATION
AND MOBILE COMPUTING
COURSE CODE: COSC3062
THIRD YEAR SECTION: ”B”
STUDENT NAME: MULUGETA TEGEGNE
ID NUMBER: 1100932
ASSIGNMENT: INDIVIDUAL
INSTRUCTOR NAME: MAHAMMED YESYF
The Hadamard code is an error-correcting code that is used for
error detection and correction when transmitting messages over
very noisy or unreliable channels.
In 1971, the code was used to transmit photos of Mars back to
Earth from the NASA space.
1|Page
Generalized Hadamard codes:
• The Hadamard codes are relatively easy to decode; they are the first
large class of codes to correct more than a single error.
• Hadamard code is one of the family [2n, 2n+1, 2n–1] codes.
• In code division multiple access (CDMA) communication, the
Hadamard code is referred to as Walsh Code, and is used to define
individual communication channels.
• It is usual in the CDMA literature to refer to codewords as “codes”.
• The Hadamard code is an example of a linear code over a binary
alphabet that maps messages of length k to codewords of
length 2^k .
• The Hadamard code is a locally decodable code, which provides a
way to recover parts of the original message with high probability,
while only looking at a small fraction of the received word.
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.
Hadamard matrix, denoted H , is defined recursively as follows.
The N-by-N Hadamard matrix has the property that H H = NI
where I is the N-by- N identity matrix.
3|Page
The Hadamard Code Generator block outputs a row of H . The
output is bipolar.
• Hadamard codes are obtained by selecting as
codewords the rows A a Hadamard matrix.
• A Hadamard matrix A is a N >*< N matrix of 1’s and
0’s such that each row differs from any other row in
exactly N/2 locations.
• One row contains all zeros with the remainder
containing N./2 zeros and N/2 ones.
• The minimum distance for these codes is N/2.
SOURCE:
http://www.math.cuden.edu/~wcherowi/courses/m6409/mar iner9talk.pdf
LEVENSHTEIN, V.I.: Application of Hadamard matrices to a problem in
coding. Thank you……
4|Page