Problem Set 4 for ENEE626 (2008) - Linear Binary Codes - Prof. Alexander Barg, Assignments of Electrical and Electronics Engineering

Problem set 4 for the enee626 (2008) course on linear binary codes. The problems cover topics such as linear independence, uniform distribution, typical distance, and exponential asymptotics. Students are expected to use mathematical proofs and calculations to solve the problems.

Typology: Assignments

Pre 2010

Uploaded on 02/13/2009

koofers-user-u94
koofers-user-u94 🇺🇸

8 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
ENEE626 (2008). Problem set 4. Due in class on Nov. 25.
1. (10 pt)
(a) Let C {0,1}nbe a linear binary code. Let h1= (000),h2= (001),...,h8= (111).Let
As1,...,s8(C)be the number of ordered triples of linearly independent vectors of Csuch that
|{i[1..n]:(c1,i, c2,i, c3,i ) = hj}| =sj,1j8.
Prove that there exist binary linear codes such that for any 8-tuple of nonnegative integers s1, . . . , s8where
s1+· · · +s8=n,
As1,...,s8(C)n823(nk)n
s1, . . . , s8.
(b) Generalize this claim from triples to t-tuples.
2. (20 pt) Let S={xFn
2: wt(x) = w}.
(a) Suppose that vectors from Sare chosen with uniform distribution. Let Xibe the random variable
whose value equals the ith coordinate of the vector. What is P(Xi= 1)?
(b) Given n, i, j, are Xiand Xjindependent r.v.’s? What if n ?What about r.v.’s Xi1, Xi2, . . . , Xir?
Consider the cases of rfixed, r=o(n),and r= (const)n.
(c) What is the typical distance between x,yS? In other words, what is αsuch that
lim
n→∞,w→∞
w/nω
0<ω<1
P(|d(x,y)αn| n) = 0 ( > 0) ?
State and prove a precise claim that answers this question.
(d) Given 4 randomly chosen vectors of weight w, what is the typical number of coordinates iin which
(X1,i, X2,i, X3,i , X4,i) = (0,0,0,0)? (1,1,1,1)? (1,0,0,0)? (1,1,0,0)?
3. (10pt) Solve Problem 5 from final exam of 2007 (posted on class web page).
4. (10 pt) Let R(C)be the code rate and let δ(C)be the relative distance of a given code C. Define the
functions
Rm(δ) = lim sup
n→∞
max{R(C)|δ(C)δ, C Fn
2}
δm(R) = lim sup
n→∞
max{δ(C)|R(C)R, C Fn
2}.
Let δm(x)f(x)for a continuous, strictly decreasing function fdefined on an open interval. Prove that
then Rmf1(δ).
5. (10 pt) Consider the ensemble of linear codes given by randomly chosen (nk)×nparity-check
matrices.
(a) Let D(C)be the r.v. equal to the distance of a random code from the ensemble. Find limn→∞
ED(C)
n.
(b) What is the typical relative distance of codes in this ensemble? (Formulate a precise claim and prove
it.)
6. (10 pt) Let n , m =µn, r =ρn, s =σn; 0 < ρ < µ.
(a) Compute the exponential asymptotics of
F(r) = s
rns
mr.
In other words, find αsuch that
lim
n→∞
1
nlog2
F(r)
2αn = 0.
pf2

Partial preview of the text

Download Problem Set 4 for ENEE626 (2008) - Linear Binary Codes - Prof. Alexander Barg and more Assignments Electrical and Electronics Engineering in PDF only on Docsity!

ENEE626 (2008). Problem set 4. Due in class on Nov. 25.

  1. (10 pt)

(a) Let C ⊂ { 0 , 1 }n^ be a linear binary code. Let h 1 = (000), h 2 = (001),... , h 8 = (111). Let As 1 ,...,s 8 (C) be the number of ordered triples of linearly independent vectors of C such that

|{i ∈ [1..n] : (c 1 ,i, c 2 ,i, c 3 ,i) = hj }| = sj , 1 ≤ j ≤ 8.

Prove that there exist binary linear codes such that for any 8 -tuple of nonnegative integers s 1 ,... , s 8 where s 1 + · · · + s 8 = n,

As 1 ,...,s 8 (C) ≤ n^82 −3(n−k)

n s 1 ,... , s 8

(b) Generalize this claim from triples to t-tuples.

  1. (20 pt) Let S = {x ∈ Fn 2 : wt(x) = w}.

(a) Suppose that vectors from S are chosen with uniform distribution. Let Xi be the random variable whose value equals the ith coordinate of the vector. What is P (Xi = 1)?

(b) Given n, i, j, are Xi and Xj independent r.v.’s? What if n → ∞? What about r.v.’s Xi 1 , Xi 2 ,... , Xir? Consider the cases of r fixed, r = o(n), and r = (const)n.

(c) What is the typical distance between x, y ∈ S? In other words, what is α such that

n→∞^ lim,w→∞ w/n→ω 0 <ω< 1

P (|d(x, y) − αn| ≥ n) = 0 (∀ > 0)?

State and prove a precise claim that answers this question. (d) Given 4 randomly chosen vectors of weight w, what is the typical number of coordinates i in which (X 1 ,i, X 2 ,i, X 3 ,i, X 4 ,i) = (0, 0 , 0 , 0)? (1,1,1,1)? (1,0,0,0)? (1,1,0,0)?

  1. (10pt) Solve Problem 5 from final exam of 2007 (posted on class web page).
  2. (10 pt) Let R(C) be the code rate and let δ(C) be the relative distance of a given code C. Define the functions Rm(δ) = lim sup n→∞

max{R(C) | δ(C) ≥ δ, C ⊂ Fn 2 }

δm(R) = lim sup n→∞

max{δ(C) | R(C) ≥ R, C ⊂ Fn 2 }.

Let δm(x) ≤ f (x) for a continuous, strictly decreasing function f defined on an open interval. Prove that then Rm ≤ f −^1 (δ).

  1. (10 pt) Consider the ensemble of linear codes given by randomly chosen (n − k) × n parity-check matrices.

(a) Let D(C) be the r.v. equal to the distance of a random code from the ensemble. Find limn→∞ ED n(C ). (b) What is the typical relative distance of codes in this ensemble? (Formulate a precise claim and prove it.)

  1. (10 pt) Let n → ∞, m = μn, r = ρn, s = σn; 0 < ρ < μ.

(a) Compute the exponential asymptotics of

F (r) =

s r

n − s m − r

In other words, find α such that

n^ lim→∞

n

log 2

F (r) 2 αn^

(b) In the same setting, compute the exponential asymptotics of ∑^ r

i=

s i

n − s m − i

Consider separately the cases ρ > σμ and ρ < σμ.