Scribd Logo
Upload

Welcome to Scribd!

  • Question 1 - Sparse, Unbiased, Codes Have Many Low Density Parity Checks

    Uploaded by

    Amit Sinhababu
    28 views1 page
    This document contains 3 questions related to coding theory: 1) For a sparse, unbiased code C, the number of parity checks in the dual code C^⊥ of weight k is approximately n * (k-1)^k / |C| for a sufficiently large constant k. 2) Show an efficient algorithm for decoding Bose-Chaudhuri-Hocquenghem (BCH) codes when the number of errors approaches half the minimum distance. 3) Design and analyze an efficient list decoding algorithm for an algebraic geometry code over a finite field GF(q^2) with codewords being bivariate polynomials of degree at most q over q points in the finite field.

    Original Description:

    Original Title

    pset3

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains 3 questions related to coding theory: 1) For a sparse, unbiased code C, the number of parity checks in the dual code C^⊥ of weight k is approximately n * (k-1)^k / |C| for a sufficiently large constant k. 2) Show an efficient algorithm for decoding Bose-Chaudhuri-Hocquenghem (BCH) codes when the number of errors approaches half the minimum distance. 3) Design and analyze an efficient list decoding algorithm for an algebraic geometry code over a finite field GF(q^2) with codewords being bivariate polynomials of degree at most q over q points in the finite field.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    28 views1 page

    Question 1 - Sparse, Unbiased, Codes Have Many Low Density Parity Checks

    Uploaded by

    Amit Sinhababu
    This document contains 3 questions related to coding theory: 1) For a sparse, unbiased code C, the number of parity checks in the dual code C^⊥ of weight k is approximately n * (k-1)^k / |C| for a sufficiently large constant k. 2) Show an efficient algorithm for decoding Bose-Chaudhuri-Hocquenghem (BCH) codes when the number of errors approaches half the minimum distance. 3) Design and analyze an efficient list decoding algorithm for an algebraic geometry code over a finite field GF(q^2) with codewords being bivariate polynomials of degree at most q over q points in the finite field.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    6.

    440 Essential Coding Theory

    MIT, Fall 2011

    Problem Set 3
    Instructor: Dana Moshkovitz Due: November 22, 2011. November 7, 2011

    Question 1 - Sparse, unbiased, codes have many low density parity checks
    Suppose that a code C {0, 1}n is: (i) sparse, in the sense that |C| n2 (rather than |C| = 2(n) ); (ii) 2/n0.1 -biased. Show that for a suciently large constant k, the number of parity checks in C of weight k is: ( ) ( ( 1 )) n 1+o n k . |C| You may use the following fact about the Krawtchouk polynomials: for 1/2 and suciently large k, for (n n )/2 i (n + n )/2, it holds that |Pk (i)| 2nk .

    Question 2 - Decoding BCH


    Show an ecient algorithm for decoding BCH codes when the number of errors approaches half the distance.

    Question 3 - List decoding algebraic geometry codes


    In class we saw a toy example of an algebraic geometry code: { } Let q be prime. Let F = GF (q 2 ) be a nite eld. Let S = (x, y) F2 N (x) = T r(y) . The code contains a codeword per bivariate polynomial p of degree at most q over F. The codeword is of length |S| = q 3 . Position (x, y) S of the codeword is p(x, y). Design and analyze an ecient list decoding algorithm for this code.

    You might also like