4C7DigitalCommunicationsTutorial1Solutions

1. Considerasystematicblockcodewhoseparitycheckequationsare:
= + +
= + +
= + +
= + +

wheremiarethemessagebits,i=0,1,2,3,andbiarethecheckbits,i=0,1,2,3.

(a) Whataretheparametersnandk?Findthegeneratormatrixforthecode.
(b) WhatistheminimumHammingdistance?Howmanyerrorscanthecodecorrect?
(c) Isthevector[10101010]avalidcodeword?
(d) Isthevector[01011100]avalidcodeword?

Solutions:

(a) n=8,k=4
1 1 1 0 1 0 0 0

1 0 1 1 0 1 0 0
G =
0 1 1 1 0 0 1 0

1 1 0 1 0 0 0 1

Note:Iassumedthattheparitybitscomeatthebeginningofthecodeword.Itwouldalsohave
beenfinetoswapthematricesIandP,makingtheparitybitscomeattheendofthecodeword.

(b) Allpossiblemessagesandcorrespondingcodewordsaretabulatedbelow:

m c m c
0000 00000000 1000 11101000
0001 11010001 1001 00111001
0010 01110010 1010 10011010
0011 10100011 1011 01001011
0100 10110100 1100 01011100
0101 01100101 1101 10001101
0110 11000110 1110 00101110
0111 00010111 1111 11111111

dmin=4,sowecancorrectallsingleerrors.

 1 0 0 0

0 1 0 0
1 0 0 0 1 1 0 1 0 0 1 0

0 1 0 0 1 0 1 1 0 0 0 1
(c) H = ,and H T =
1 1 0
.
0 0 1 0 1 1 1 0 1

0 1 1 0 1 1
0 0 1 0 1 1

0 1 1 1
1 1 0 1

(1 0 1 0 1 0 1 0 )H T = (0 0 1 1) ,sonotacodeword.

(d) (0 1 0 1 1 1 0 0 )H T = (0 0 0 0 ) ,soavalidcodeword.

2. Considera(7,4)linearblockcodewhosegeneratormatrixis:

1 1 1 1 0 0 0

1 0 1 0 1 0 0
G =
0 1 1 0 0 1 0

1 1 0 0 0 0 1 .

(a) Findallthevalidcodewords.
(b) FindH,theparitycheckmatrixofthecode.
(c) Computethesyndromeforthereceivedvector[1101101].Isthisavalidcodeword?
(d) Whatistheerrorcorrectingcapabilityofthecode?
(e) Whatistheerrordetectingcapabilityofthecode?

Solutions:

(a) Allmessagesandcorrespondingcodewordsarelistedbelow:

m c m c
0000 0000000 1000 1111000
0001 1100001 1001 0011001
0010 0110010 1010 1001010
0011 1010011 1011 0101011
0100 1010100 1100 0101100
0101 0110101 1101 1001101
0110 1100110 1110 0011110
0111 0000111 1111 1111111

 1 0 0 1 1 0 1

(b) H = 0 1 0 1 0 1 1
0 0 1 1 1 1 0


(c) s = (1 1 0 1 1 0 1)H T = (0 1 0 ) ,sonotacodeword.

(d) dmin=3,socancorrectallsingleerrors.

(e) Candetectallsingleanddoubleerrors.

3. Thegeneratormatrixforalinearbinarycodeis
0 0 1 1 1 0 1

G = 0 1 0 0 1 1 1 .
1 0 0 1 1 1 0

(a) ExpressGinsystematic[P|I]form.
(b) DeterminetheparitycheckmatrixHforthecode.
(c) Constructthetableofsyndromesforthecode.
(d) Determinetheminimumdistanceforthecode.
(e) Demonstratethatthecodewordcorrespondingtoinformationsequence101isorthogonal
toH.

Solutions:

1 0 1 1 1 0 0

(a) G = 1 1 1 0 0 1 0 ,byswappingcolumns1and7,columns2and6,andcolumns3
0 1 1 1 0 0 1

and5.

1 0 0 0 1 1 0

0 1 0 0 0 1 1
(b) H =
0 0 1 0 1 1 1

0 0 0 1 1 0 1


(c) Thesyndrometableisbelow:


Syndrome Cosetleader Syndrome Cosetleader
0000 0000000 1000 1000000
0001 0001000 1001 1001000,
 0010100,
0000011
0010 0010000 1010 1010000,
0100010,
0001100
0011 1000100, 1011 0000100
0100001,
0011000
0100 0100000 1100 1100000,
0010010,
0000101
0101 0101000, 1101 1101000,
0010001, 0110100,etc.
0000110
0110 1000010, 1110 0000010
0110000,
0001001
0111 0000001 1111 1000001,
0100100,
0001010



(d) dmin=4.

(e) m = (1 0 1) , c = mG = (1 1 0 0 1 0 1) , cH T = (0 0 0 0 ) ,soorthogonal.