Scribd
Upload
109 views1 page

Field Axioms & Linear Codes Homework

This document outlines homework problems on fields and linear codes that are due on October 28th. For fields, it asks to prove various properties including that for any element x in a field F, x^0 = 0x = 0, and that (-1)^x = -x for even x and (-1)^x = -(x) for odd x. It also asks to show that the set of integers modulo a prime p form a field. For linear codes, it asks to prove properties about the weights of codewords, constructing a larger code from two codes, and achieving the Gilbert bound with a linear code.

Uploaded by

Fengxing Zhu
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
109 views1 page

Field Axioms & Linear Codes Homework

This document outlines homework problems on fields and linear codes that are due on October 28th. For fields, it asks to prove various properties including that for any element x in a field F, x^0 = 0x = 0, and that (-1)^x = -x for even x and (-1)^x = -(x) for odd x. It also asks to show that the set of integers modulo a prime p form a field. For linear codes, it asks to prove properties about the weights of codewords, constructing a larger code from two codes, and achieving the Gilbert bound with a linear code.

Uploaded by

Fengxing Zhu
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/ 1

EECS 554

Homework 5

Due: 10/28

1 Fields
1.1 Using only the axioms of fields show that for a field F,

∀x ∈ F , x0 = 0x = 0

1.2 For a field F , show that (−1)x = −x. Also, show that (−1)(−1) = 1, where 1 is the
unit element of the field. Conclude that for positive integer p, (−a)p = ap for even p and
(−a)p = −(ap ) for odd p. The notation ap is shorthand for multiplying a with itself p times.

1.3 Show that the set {0, 1, . . . , p − 1}, where p is a prime, with standard addition and
multiplication modulo p is a field. Since it is straightforward to show all properties but the
existence of an inverse, you can focus on this task. This field is usually denoted by Z/p.

1.4 Consider a finite field F , and a subset G of F . Prove that in order to show that G is
a subfield, it is sufficient to show that (i) G is closed under addition and multiplication, and
(ii) G contains a non-zero element.

2 Linear Codes
2.1 Let C be a linear binary code. Show that either half of the codewords have even weight,
or all the codewords have even weight.

2.2 Let C1 be an (n, k1 ) linear code with minimum distance d, and C2 be another (n, k2 )
linear code with minimum distance 2d. Show that the code C consisting of all codewords of
the form (c1 |c1 + c2 ) with c1 ∈ C1 and c2 ∈ C2 is a linear (2n, k1 + k2 ) code with minimum
distance 2d.

2.3 Prove that the Gilbert bound can be achieved by linear codes.
Hint: Fix the underlying field F (with |F | = q), and the numbers n and d. Then design
a linear code C over F with blocklength n and minimum distance at least d, i.e., dmin (C) ≥ d.
If C does not satisfy the bound, consider enlarging it as follows: pick v ∈ F n such that its
distance from all codewords in C is at least d and define C ′ = {u − av|u ∈ C, a ∈ F }.

You might also like