MURI Research
Topic: Minimum Distance of Error Correcting Codes versus Encoding Complexity, Symmetry, and Pseudorandomness
By: Louay Bazzi (MIT), Sanjoy Mitter (MIT), Daniel Spielman (MIT)
Summary:
Bazzi thesis abstract (MIT, EECS, Aug 22 , 2003 ): We study the minimum distance of binary error correcting codes from the following perspectives: i) The problem of deriving bounds on the minimum distance of a code given constraints on the computational complexity of its encoder. ii) The minimum distance of linear codes that are symmetric in the sense of being invariant under the action of a group on the bits of the codewords. iii) The derandomization capabilities of probability measures on the Hamming cube based on binary linear codes with good distance properties, and their variations. Highlights of our results include: 1) A general theorem that asserts that if the encoder uses linear time and sub-linear memory in the general binary branching program model, then the minimum distance of the code cannot grow linearly with the block length when the rate is nonvanishing. 2) New upper bounds on the minimum distance of various types of Turbo-like codes. 3) The first ensemble of asymptotically good Turbo like codes. We prove that depth-three serially concatenated Turbo codes can be asymptotically good. 4) The first ensemble of asymptotically good codes that are ideals in the group algebra of a group. We argue that, for infinitely many block lengths, a random ideal in the group algebra of the dihedral group is an asymptotically good rate half code with a high probability. 5) An explicit rate-half code whose codewords are in one-to-one correspondence with special hyperelliptic curves over a finite field of prime order where the number of zeros of a codeword corresponds to the number of rational points. 6) A sharp $O(k^{-{1/2}})$ upper bound on the probability that a random binary string generated according to a $k$-wise independent probability measure has any given weight. 7) An assertion saying that any sufficiently log-wise independent probability measure looks random to all polynomially small read-once DNF formulas. 8)An elaborate study of the problem of derandomizability of $AC_0$ by any sufficiently polylog-wise independent probability measure. 9) An elaborate study of the problem of approximability of high-degree parity functions on binary linear codes by low-degree polynomials with coefficients in fields of odd characteristics.


Questions and comments to the webmaster. This page is copyrighted by the Massachusetts Institute of Technology.