• Keine Ergebnisse gefunden

1 Prove: Suppose C is a linear [n, k]-code having generator matrix G

N/A
N/A
Protected

Academic year: 2022

Aktie "1 Prove: Suppose C is a linear [n, k]-code having generator matrix G"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

1 Problem sheet 6

2006 MT3610/5461 Error correcting codes

Ex. 1

Prove: Suppose C is a linear [n, k]-code having generator matrix G. Then a vector ~v ∈ V(n, q) belongs to C ⇔ ~vG> = 0, where G> denotes the transpose ofG.

Ex. 2

Determine the dual codes C1 and C2 for C1 = {000,111} and C2 = {00000,11111}.

Ex. 3

Prove that ifEn is the binary even weight code of length n, then En is the repetition code of lengtn. Give the generator matrices and the parity check matrices for the two codes.

Ex. 4

LetC be the ternary linear code with generator matrix

1 1 1 0

2 0 1 1

.

a) Find a generator matrixG forC in standard form b) Find a parity check matrix H forC in standard form.

Referenzen

ÄHNLICHE DOKUMENTE

However, we feel that it is desirable to collect in one place all known results which may be useful in linear regression problems, and to show how these matrices arise naturally in

I propose that we should redesign our mental method for asking the questions by formulating our knowledge as a simulation of the system and then looking at the equations formulated

In [6], the constructive membership problem is solved for free groups G ≤ PSL 2 ( R ) of rank 2 using the Ping-Pong Lemma and a suitable fundamental domain for the action of G on

Further show that C has distance d if and only if any d − 1 rows of a parity check matrix H are linearly independent but there exist d rows which

b) Since it may be tedious to write down the generator and parity check matrix in a): Explain with Ham(3,2) and a suitable parity-check ma- trix H (and generator matrix G) how

Then we construct annual climate networks from NCEP/NCAR reanalysis data for the Asian monsoon domain for the time period of 1970–2011 CE and use the CCEF to characterize the

For example, consider the case of the regular code with message nodes having degree 3 and check nodes having degree 6 (a rate 1/2 code), using the decoding algorithm of Section 2.

A directed graph (gerichteter Graph) is as well a pair G=(V,E). However, the elements of E are ordered pairs of elements from V.. 2475 3) Multiply the entries of an