Channel Coding Part II - Digital Communication Chapter 6 & 7 - Unik
Channel Coding Part II - Digital Communication Chapter 6 & 7 - Unik
Channel Coding Part II - Digital Communication Chapter 6 & 7 - Unik
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Hamming distance and weight<br />
<strong>Channel</strong> <strong>Coding</strong><br />
<strong>Part</strong> <strong>II</strong><br />
Ola Jetlund<br />
◮ Hamming weight: w(U i ) = the number of non-zero<br />
elements in U i .<br />
◮ Hamming distance: d(U i , U j ) = w(U i ⊕ U j )<br />
◮ Minimum distance:<br />
Introduction<br />
Linear Block Codes<br />
Hamming<br />
Convolutional Codes<br />
Example<br />
Decoding<br />
Decisions<br />
Viterbi<br />
d min = min d(U i , U j ) = min w(U i )<br />
i≠j<br />
i
Change language