Definitions Flashcards
Alphabet
An alphabet is a set F such that |F| > 1
Symbol
A symbol is an element of the alphabet
Information
Information is a (long) sequence of symbols
Binary alphabet
F = F_2 = {0, 1}
Binary symmetric channel
The binary symmetric channel denoted BSC(p) is the following: Input Probability Output 0 1-p 0 0 p 1 1 1-p 1 1 p 0 The probability of a bit error is p
Word of length n
A word of length n in the alphabet F is an element of F^n = { v = (v1,…,vn) : v1,…,vn ∈ F}
Hamming Distance
The hamming distance d(x,y) is the number of positions where x differs from y
d(x,y)
d(x,y) = | {i ∈ (1,…,n) : xi != yi} |
Code of length n
A code of length n in the alphabet F is a non empty subset of F^n. C ⊆ F^n, C != ø
Codeword
A codeword is an element of a given code
Detected error
If y ∈ F^n but not C then a detected error has occurred
Undetected error
If y ∈ F^n and C then an undetected error has occurred
Decoder
A decoder is a function DECODER: F^n —> C such that ∀y ∈ F^n DECODE(y) is a nearest neighbour of y in C
Nearest neighbour
A nearest neighbour of a word y in the code C is a codeword v ∈ C such that d(y,v) = min{d(y,z) : z ∈ C}
Decoded correctly
If c is transmitted and y is the received word such that y != c but DECODE(y) = c we say that the received word was decided correctly
Let C ⊆ F^n be a code, what is n
n is the length of the code
Let C ⊆ F^n be a code, what is M
M = |C|, the number of codewords