Coding Theory

- Communicate efficiently (a human problem)

o Sender
 message
o Receiver
 Feedback
o Noise
 Distort the message
- Error correcting codes for the reliable transmission of info across noisy channels
- Data is usually transferred in the from of a series of 0 and 1

Source coding

- Changing message to a suitable code

- Source encoder
o Transforms the source output into a sequence of symbols which we call message
o American Standard Code for Info Interchange
 Electronic info
- Codeword is a string of 0 and 1
o Ex:
 Stop - 000
 Go - 101
 Wait – 110
 Code: (000, 101, 110)
- The length oof a codeword is the number of binary digits
- Encode
o Message becomes a codeword
- Decode
o Received codeword is reverted back to a message

Parity Check

- where a single bit is appended to a bit string. A bit string has odd parity if the number of 1s in
the string is odd. A bit string has even parity if the number of 1s in the string is even.]
- Ex: 10010011
o Count number of 1’s
o Even parity = 0 since the 1’s is even
o Odd parity = 1 since you need one more 1 to make odd
o Error, if the used parity is not odd/even
- Odd is more preferable
- Fails if there 2 errors

This study source was downloaded by 100000817325835 from CourseHero.com on 10-18-2023 20:27:58 GMT -05:00

https://www.coursehero.com/file/141773069/Coding-theorydocx/
 Repetition codes and Majority decoding

- The simplest possible error-correcting code is the repetition code. The idea is that if we want to
send a message, we could repeat each digit a certain number of times. In this way, even if a
number of digits got garbled in transmission, the original message may be recovered from any
message by identifying the one which appears most frequently in a block. This process is called
majority decoding.
- For instance, if we want to send the message (not in codeword) NEXT, we could repeat each digit
5 times and send NNNNNEEEEEXXXXXTTTTT. If the receiver gets NNNNNEEFEEXXXXXTTTIT, it can
still recognize the message by determining the letter that appears often is a block.
- K = bits, r = no. of repetition
o n = kr
o n = length
o code: (n,k)
o eX: 011010 = (18,6)
 n = 18
 k=6
 r = n/k
 18/6 = 3
 000 111 111 000 111 000
- Majority coding
o Majority of number is the real number if theres error

Hamming Distance

- Number of difference between corresponding bits

- If x and y are two bits (binary strings) then the hamming distance is denoted d(x,y)
o Ex: d(0010, 1100)
 0010
 1100
 Three different bits since the fourth one is the same while the rest isn’t
 So distance = 3
- Nearest neighbor Decoding
o Ex: C = (0000 0000, 0000 1111, 1111 1111)
 Y = 111 1010 (given)
 Get hamming distant of c compared to y
 (0000 0000) and 1111 1010 = 6
 (0000 1111) and 1111 1010 = 6
 (1111 1111) and 1111 1010 = 2
 The code must be 1111 1111 since the smallest value is 2
 If hamming distance has 2 close values, then error

This study source was downloaded by 100000817325835 from CourseHero.com on 10-18-2023 20:27:58 GMT -05:00

https://www.coursehero.com/file/141773069/Coding-theorydocx/
 Minimum Distance of code

- Smallest distance between between 2 distinct codewords in word

o Ex: C = (111, 110, 011)
 Compare each bit to see distance
 (111 & 110) = 1
 (111 & 001) = 1
 (110 & 011) = 2
 Min distance is 1

Detect and Correct

- Min = 2e + 1
- 2e is the detect
- e is the correct

The Number Phi

- a is longer than b
- a+b = the full length
- a is the width
- a/b = (a+b)/a = phi
- phi = 1 + (1/phi)
- phi^2 = phi + 1
- a/b = phi
- 1-phi = 1/phi
-

Fibonacci Sequence and Golden Ratio

- Leonardo of pisa
- n>1
η n
1+ √ 5 1−√ 5
- Binet form of the Fibonacci nth number equation ( ( 2 ) (
−
2 )
) / sq5

Find the number in the sequence

o
- 1.61803398875

Fractals: Construction

This study source was downloaded by 100000817325835 from CourseHero.com on 10-18-2023 20:27:58 GMT -05:00

https://www.coursehero.com/file/141773069/Coding-theorydocx/
 - A fractal is a never-ending pattern. Fractals are infinitely complex patterns that are self-similar
across different scales. They are created by repeating a simple process over and over in an
ongoing feedback loop.
- The word fractal was coined in 1980 by the Belgian mathematician Benoit Mandelbrot (1924-
2010). Mandelbrot chose the name fractal because it reminds us of the word "fraction".
- Initiator = line
- Self similarity = Koch curve/snowflake = infinite permeter
- Generator = take line and replace it with generator
- Menger sponge = three d version of koh snowflake / cube thing
- Mandelbrot set = blac black hole infinite
- Sierpinski gasket = triangle thing

This study source was downloaded by 100000817325835 from CourseHero.com on 10-18-2023 20:27:58 GMT -05:00

https://www.coursehero.com/file/141773069/Coding-theorydocx/
Powered by TCPDF (www.tcpdf.org)