20150101 coding theory course 2_linear block code hamming code

Upload: ahshali

Post on 27-Feb-2018

225 views

Category:

Documents


0 download

TRANSCRIPT

  • 7/25/2019 20150101 Coding Theory Course 2_Linear Block Code Hamming Code

    1/12

    Part 2 Linear block codes

    1.14 Definition and Generator Matrix

  • 7/25/2019 20150101 Coding Theory Course 2_Linear Block Code Hamming Code

    2/12

  • 7/25/2019 20150101 Coding Theory Course 2_Linear Block Code Hamming Code

    3/12

    1.15 Coding Scheme

  • 7/25/2019 20150101 Coding Theory Course 2_Linear Block Code Hamming Code

    4/12

    1.16 RRE Generator Matrix

  • 7/25/2019 20150101 Coding Theory Course 2_Linear Block Code Hamming Code

    5/12

    1.17 Systematic Code

    First definition:

    Second definition:

    The k information symbols appear in the first k positions of any

    codeword.

  • 7/25/2019 20150101 Coding Theory Course 2_Linear Block Code Hamming Code

    6/12

    1.18 Dual Code and Parity Check Matrix

  • 7/25/2019 20150101 Coding Theory Course 2_Linear Block Code Hamming Code

    7/12

    The dual code of an [n, k] linear with generator

    matrix G=[Ik, A], is an [n, n-k] linear code with

    parity check matrix H=[-AT

    , In-k].

    Another def in i t ion of par i ty check matr ix:Let G

    and H be two matrices with full row rank. G is a

    generator of a linear block code. Then, HGT=O if and

    only if H is a parity check matrix.

    How to count the number of generator matrices andparity check matrices with given parameters ? See additional

    materials.

  • 7/25/2019 20150101 Coding Theory Course 2_Linear Block Code Hamming Code

    8/12

  • 7/25/2019 20150101 Coding Theory Course 2_Linear Block Code Hamming Code

    9/12

  • 7/25/2019 20150101 Coding Theory Course 2_Linear Block Code Hamming Code

    10/12

    The syndrome decoding is a kind of minimum

    distance decoding.

    Using syndrome decoding, for given y and then itssyndrome s, the complexity for searching z with the

    minimal weight in the solutions of s=HZT, is qk

    Without using syndrome decoding, for given y, thecomplexity for searching the closest codeword x, is

    also qk

    Then, use or do not use syndrome decoding ?

  • 7/25/2019 20150101 Coding Theory Course 2_Linear Block Code Hamming Code

    11/12

    1.20 Hamming code

    Binary Hamming Code

  • 7/25/2019 20150101 Coding Theory Course 2_Linear Block Code Hamming Code

    12/12

    Nonbinary Hamming Code

    Counting the number of binary Hamming codes and q-ary Hamming

    codes with given parameters. See additional materials.