CODING THEORY

A Birds Eye View : Continued Block Codes: Basics

Types of Channel Codes

Block Codes ( Codes with strong algebraic flavor) ~1950--- Hamming Code (Single error correction) All codes in 50s were too weak compared to the codes promised by Shannon Major Breakthrough..1960 BCH Codes Reed-Solomon Codes Capable of correcting Multiple Errors

Convolutional Codes

Codes with Probabilistic flavor. Late 1950s but gained popularity after the introduction of Viterbi algorithm in 1967. Developed from the idea of sequential decoding Non-block codes Codes are generated by a convolution operation on the information sequence

10

Coding Schemes: Trend

Since 1970s the two avenues of research started working together This resulted in the development towards the codes promised by Shannon Today Turbo Codes, are capable of achieving an improvement close to Shannon Limit

11

Coding Schemes

Applications demand for wide range of data rates, block sizes, error rates. No single error protection scheme works for all applications. Some requires the use of multiple coding techniques. A common combination uses an inner convolutional code and an outer Reed-Solomon code.

12

13

14

15

Slide 3

16

17

18

19

20

21

BLOCK CODES

Introduction

Block codes: basic definitions

An alphabet is a discrete (usually finite) set of symbols. example: B = { 0; 1} is the binary alphabet Definition: A block code of blocklength n over an alphabet X is a nonempty set of n-tuples of symbols from X. The n-tuples of the code are called code words. Code words are vectors whose components are symbols in X.

23

Block codes: basic definitions

Code words of length n are typically generated by encoding messages of k information bits using an invertible encoding function. Number of codewords is M = 2k , Rate R = k/n The rate is a dimensionless fraction; the fraction of transmitted symbols that carry information. A code with blocklength n and rate k/n is called an (n; k) code

24

Systematic encoder

The error protection ability of a block code depends only on the set of codewords, not on the mapping from source messages to codewords. An encoder is systematic when it copies the k message symbols unchanged into the codeword. Codewords are of the form c = [m p ] or c = [ p m] where m is the vector of k message symbols and p is the vector of n-k redundant or check symbols.
25

Linear Block Codes

c mG

where, c code word (vector)

m message word (vector)

G Generator matrix

26

Vector Space-Introduction

An n-dimensional vector has a form x = ( x1, x2, x3, , xn ) . The set Rn of n-dimensional vectors is a vector

space.

Any set V is called a vector space if it contains objects that behave like vectors: ie, they add & multiply by scalars according to certain rules. In particular, they must be closed under vector addition and scalar multiplication. But addition & scalar multiplication need not be defined conventionally!
27

Contd

Let V denote the vector space.The addition on V is vector addition.The scalar multiplication combines a scalar from a Field F and a vector from V. Hence V is defined over a field F. V must form a commutative group under addition For any element a in F and any element v in V, a.V is an element in V. Distributive law- a.(u+v)=a.u+a.v Associative law- (a.b).v=a.(b.v)

28

Contd.

Important vector spaces: R, R2, R3, Rn with usual + and scalar multn. Mmn ; the set of all m x n matrices Pn; all polynomials of degree n
Consider a vector space over binary field F2.Consider the sequence u=u0un-1 where the ui s are from {0,1}.We can construct such 2n n-tuples over F2.Let Vn denote this set. Vn is a Vector space over F2

29

Subspaces

A set W of vectors is a subspace of vector space V if and only if W is a subset of V and W is itself a vector space under the same addition and scalar multiplication. For any two vectors u,v W, (u+v) W. For any element a in F and any u in W, a.u must be in W.

30

Contd
To test if W is a Subspace We should, but need not, check all the properties of a vector space in W: most hold because Ws vectors are also in the bigger vector space V. But we must check closure in W: linear combinations of vectors in W must also lie in W.

This means the zero & additive inverses must be in W too.

31

Examples

Let u1,.,uk be a set of k vectors in V over a field F. The set of all linear combinations of u1,.,uk forms a subspace of V. The set of polys of degree 2 or less is a subspace of the set of polynomials of degree 3 or less. The set of integers is not a subspace of R, because the set of scalars includes fractions, eg 1/2.
32