Scribd
Upload
29 views3 pages

INGI 2348 - Exercices 1: Binary Linear Codes: Reminders

This document provides reminders and definitions for various concepts in binary linear codes, including packing distance, the Hamming bound, parity matrices, generating matrices, minimum distance, cosets, and syndrome decoding. It then presents 5 problems analyzing specific binary codes to determine their characteristics and parameters, perform decoding, prove perfect codes, determine maximum rates, find equivalent matrices, and compute cosets, syndromes and syndrome decoding.

Uploaded by

Hamed Mir
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
29 views3 pages

INGI 2348 - Exercices 1: Binary Linear Codes: Reminders

This document provides reminders and definitions for various concepts in binary linear codes, including packing distance, the Hamming bound, parity matrices, generating matrices, minimum distance, cosets, and syndrome decoding. It then presents 5 problems analyzing specific binary codes to determine their characteristics and parameters, perform decoding, prove perfect codes, determine maximum rates, find equivalent matrices, and compute cosets, syndromes and syndrome decoding.

Uploaded by

Hamed Mir
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

INGI 2348 - Exercices 1: Binary linear codes

Reminders
j k
d(C)−1
Packing distance: t(C) = 2

Hamming bound: For a code of length n, size M and packing distance t(C),
t(C)
X
M Cni ≤ 2n
i=0

Parity matrix:

H xT = 0
(n − k × n) (n × 1) (n − k × 1)

Canonical form: H = [A|I]


Equivalent parity matrices: H 0 = QH,
where Q is a nonsingular binary matrix (n − k × n − k)
Generating matrix:

x = uG with G = [Ik | − AT ]

Minimum distance = minimum weight (for linear codes)


Cosets: C + a = {x + a : x ∈ C}
The coset leader is the minimum weight vector in the coset
Syndrome: s = Hy T (s ∈ An−k )

1
Problem 1: Binary codes characteristics
For the codes below, determine the length, rate, minimum distance, and
packing distance. Are they linear codes?
 
0 0 0 0 0 0  
 0 1 0 1 0 1 
C1 =   C2 = 0 0 0 0 0
 1 0 1 1 0 0  1 1 1 1 1
1 1 1 0 1 0

For C1 , perform the decoding of the following received vectors:

y1 = [010001] y2 = [111000] y3 = [110100]

Problem 2: Perfect codes


Prove that the repetition code of length 5 is a perfect code. Show that the
repetition code of length 4 is not a perfect code.

Problem 3: Bounds on codes


We would like to design a code of length 12 that is able to correct 2 errors in
any position. What is the maximum rate for which such a code is available?

Problem 4: Parity matrix


Consider the linear code characterized by the following parity matrix:
 
1 0 0 0 1 0 1
 0 1 0 0 1 1 0 
H=  0 0 1

0 0 1 1 
0 0 0 1 0 0 1

• Determine the codebook (set of codewords), the code length, the code
rate, the rank of the code, the minimum distance, and the packing
distance

• Find a generating matrix

• Find an equivalent parity matrix (i.e. that corresponds to the same


codebook)

2
Problem 5: Cosets and syndrome decoding
For the following code:
 
0 0 0 0 0
 0 1 1 1 0 
C3 = 
 1

0 1 0 1 
1 1 0 1 1

• Provide a parity matrix. Determine the characteristics of the code


(length, rate,...)

• Compute all the different cosets and coset leaders

• Compute the syndromes corresponding to the different cosets

• Perform the syndrome decoding of the following received vectors:

y4 = [10100] y5 = [01011] y6 = [00111]

• Why is syndrome decoding not really useful here?

You might also like