Reading...
Play button
Play button
Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
5 Cards in this Set
- Front
- Back
|
What is the Hamming distance between codewords 10010010 and 11001100?
|
5
|
|
|
What is a necessary and sufficient condition for a code being k-error-correcting?
|
For any two codewords, c and c', the ball of radius k about c and the ball of radius k abut c' are disjoint.
|
|
|
What is the maximum number of errors a code of binary words with length n can correct?
|
<-- this k (where |C| is the size of the code)
|
|
|
What is a perfect code?
|
A code for which in this inequality, equality holds.
|
|
|
How does Shannon define the capacity of a channel between a transmitter and a receiver?
|
where N(t) is the number of different sequences of messages, which can be sent in time t
|
