Scribd Logo
Upload

Welcome to Scribd!

  • GEMATMW - Assign 2

    Uploaded by

    janine baez
    5 views2 pages
    The document provides examples of calculating Hamming distances between codewords in different codes. It examines the properties of a code C with minimum Hamming distance of 2, determining that such a code can detect up to 1 error but cannot correct any errors. It also gives two examples of codes C1 and C2, specifying the code length n, number of codewords M, and minimum distance d for each.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document provides examples of calculating Hamming distances between codewords in different codes. It examines the properties of a code C with minimum Hamming distance of 2, determining that such a code can detect up to 1 error but cannot correct any errors. It also gives two examples of codes C1 and C2, specifying the code length n, number of codewords M, and minimum distance d for each.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    5 views2 pages

    GEMATMW - Assign 2

    Uploaded by

    janine baez
    The document provides examples of calculating Hamming distances between codewords in different codes. It examines the properties of a code C with minimum Hamming distance of 2, determining that such a code can detect up to 1 error but cannot correct any errors. It also gives two examples of codes C1 and C2, specifying the code length n, number of codewords M, and minimum distance d for each.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    GEMATMW – Assign 2

    1. Let C={000000, 101110, 001010, 110111, 100100, 011001, 111101, 010011}

    (a) Hamming distance (000000, 101110) = 4 Hamming distance (001010, 100100) = 4


    Hamming distance (000000, 001010) = 2 Hamming distance (001010, 011001) = 3
    Hamming distance (000000, 110111) = 5 Hamming distance (001010, 111101) = 5
    Hamming distance (000000, 100100) = 2 Hamming distance (001010, 010011) = 3
    Hamming distance (000000, 011001) = 3 Hamming distance (110111, 100100) = 3
    Hamming distance (000000, 111101) = 5 Hamming distance (110111, 011001) = 4
    Hamming distance (000000, 010011) = 3 Hamming distance (110111, 111101) = 2
    Hamming distance (101110, 001010) = 2 Hamming distance (110111, 010011) = 2
    Hamming distance (101110, 110111) = 3 Hamming distance (100100, 011001) = 5
    Hamming distance (101110, 100100) = 2 Hamming distance (100100, 111101) = 3
    Hamming distance (101110, 011001) = 5 Hamming distance (100100, 010011) = 5
    Hamming distance (101110, 111101) = 3 Hamming distance (011001, 111101) = 2
    Hamming distance (101110, 010011) = 5 Hamming distance (011001, 010011) = 2
    Hamming distance (001010, 110111) = 5 Hamming distance (010011, 010011) = 4

    Minimum distance is 2.

    (b) Let C be a code with minimum Hamming distance 2e + 1


    2e + 1 = 2
    2e = 2 – 1
    2e = 1 The code can detect up to 1 error.
    (c) 2e = 1
    2e / 2 = 1 / 2
    e = 0.5 The code cannot correct any error as 0.5 will be rounded down to 0.
    2. Code length (n), Codewords (M), and minimum distance (d)
    (a) C1={0000, 1100, 0011, 1111}
    n=4
    M=4
    d=2

    Hamming distance (0000, 1100) = 2 Hamming distance (1100, 0011) = 4


    Hamming distance (0000, 0011) = 2 Hamming distance (1100, 1111) = 2
    Hamming distance (0000, 1111) = 4 Hamming distance (0011, 1111) = 2
    (b) C2={00000, 01101, 10110, 11011}
    n=4
    M=4
    d=3

    Hamming distance (00000, 01101) = 3 Hamming distance (01101, 10110) = 4


    Hamming distance (00000, 10110) = 3 Hamming distance (01101, 11011) = 3
    Hamming distance (00000, 11011) = 4 Hamming distance (10110, 11011) = 3

    You might also like