

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
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
1 / 2
This page cannot be seen from the preview
Don't miss anything!


ENEE626 (2008). Problem set 4. Due in class on Nov. 25.
(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.
(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)?
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 (δ).
(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.)
(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 ρ < σμ.