How to lie and get away with it

Slides:



Advertisements
Similar presentations
Even/odd parity (1) Computers can sometimes make errors when they transmit data. Even/odd parity: is basic method for detecting if an odd number of bits.
Advertisements

How to lie and get away with it Chris Budd How to tell the truth How to catch a liar How to lie and get away with it.
Maths and the making of the modern world The maths behind Google and the Ipod Chris Budd.
Maths and the making of the modern world The maths behind Google and the Ipod Chris Budd.
The Maths of Google and the IPod Chris Budd We live in a world full of information.
Hamming Code.
Quantum Error Correction SOURCES: Michele Mosca Daniel Gottesman Richard Spillman Andrew Landahl.
Practical Session 11 Codes. Hamming Distance General case: The distance between two code words is the amount of 1-bit changes required to reach from one.
7/2/2015Errors1 Transmission errors are a way of life. In the digital world an error means that a bit value is flipped. An error can be isolated to a single.
MAT 1000 Mathematics in Today's World Winter 2015.
Unit 1 Protocols Learning Objectives: Understand the need to detect and correct errors in data transmission.
Forward Error CORRECTION A little magic. Hamming in perspective Typically errors are corrected with retransmission. Hamming lets the receiver determine.
Binary numbers. 1 Humans count using decimal numbers (base 10) We use 10 units: 0, 1, 2, 3, 4, 5, 6, 7, 8 and (5.
The Mathematics of Star Trek Data Transmission Michael A. Karls Ball State University.
Hamming It Up with Hamming Codes CSE 461 Section Week 3.
MAT 1000 Mathematics in Today's World Winter 2015.
The Mathematics of Star Trek
Error Detection and Correction
Page 1 Data Structures in C for Non-Computer Science Majors Kirs and Pflughoeft Bits and Bytes How Many bits (or ‘doughnuts’) do we really need? Good question!
E RROR D ETECTION A ND C ORRECTION C ODES Error Detection Code (Parity bit) Error Correction Code ( Hamming Code)
Math for Liberal Studies.  A binary code is a system for encoding data made up of 0’s and 1’s  Examples  Postnet (tall = 1, short = 0)  UPC (dark.
Binary! Why do computers use binary? Easy to detect the state of a switch – they’re either on or off! Using another base makes.
Error Control Code. Widely used in many areas, like communications, DVD, data storage… In communications, because of noise, you can never be sure that.
Practical Session 10 Error Detecting and Correcting Codes.
Verification & Validation. Batch processing In a batch processing system, documents such as sales orders are collected into batches of typically 50 documents.
Binary Bracelets. Objectives Encode letters into binary Decode binary back to letters Relate the idea of storing initials on a bracelet to the idea of.
CS 111 – Sept. 13 Error detection Error correction Review/practice chapter 1 questions Commitment: –Please read sections 2.1 and 2.2.
Basic Concepts of Encoding Codes and Error Correction 1.
CS1Q Computer Systems Lecture 6 Simon Gay. Lecture 6CS1Q Computer Systems - Simon Gay2 Algebraic Notation Writing AND, OR, NOT etc. is long-winded and.
Exploring Computer Science – Lesson 2-5. Click to add text.
Error-Detecting and Error-Correcting Codes
Binary 101 Gads Hill School. Aim To strengthen understanding of how computers use the binary number system to store information.
Computer Architecture Error Correcting Codes Ralph Grishman Oct (Text pp and B-65-67) NYU.
Hamming (4,7) Code Binary Linear Codes Hamming Distance Weight of BLC
Data Transmission and Networks Transmission error checking & correcting.
Once you have been through these notes you will need to complete the workbook.
Hamming Codes The Hamming Code is a Forward Error-correcting Code (FEC) that uses redundant bits to correct a single bit error For 4 bit codes, 3 redundant.
parity bit is 1: data should have an odd number of 1's
Modulo-2 Digital coding uses modulo-2 arithmetic where addition becomes the following operations: 0+0= =0 0+1= =1 It performs the.
The Mathematics of Star Trek Workshop
Exploring Computer Science – Lesson 2-5
Unit 18: Computational Thinking
Data Link Layer.
Cyclic Redundancy Check (CRC)
Character coding schemes
Binary numbers: Week 7 Lesson 1
Error Correcting Code.
OCR AS Level F451: Data transmission
Representing characters
Binary Addition and Subtraction
Even/odd parity (1) Computers can sometimes make errors when they transmit data. Even/odd parity: is basic method for detecting if an odd number of bits.
Liar liar.

Dhanushiya. R I YEAR BSc COMPUTER TECHNOLOGY.  Error is a condition when the output information does not match with the input information. During transmission,
Learn what binary and denary mean.
Packetizing Error Detection
MAT 105 Spring 2008 Chapter 17: Binary Codes.
Lesson Objectives To understand how to add 4 and 8 bit binary numbers together To understand what is meant by the term “Overflow” ALL students will add.
Packetizing Error Detection
Objectives TO UNDERSTAND THAT CAPTURING DATA IS VALIDATED AND VERIFIED TO CHECK THAT IT IS REASONABLE AND CORRECT.
Introduction to Binary
Fundamentals of Data Representation
Packetizing Error Detection
Starter Using the fingers on only one hand, what is the highest number you can count to? Rules: You must start at 1 You must count sequentially (i.e.
The basics of any electronic device means either electricity is flowing or it is not i.e. a switch is either on or off Computers are electronic devices.
Learning Intention I will learn how computers store text.
Primitive Types and Expressions
parity bit is 1: data should have an odd number of 1's
Error Detection and Correction
Data Link Layer. Position of the data-link layer.
Presentation transcript:

How to lie and get away with it Chris Budd 

How to tell the truth How to catch a liar How to lie and get away with it

We live in a world full of information

It is important that we store and transmit this information carefully and without making mistakes Maths helps us to do this…

Storing information by telling the truth Pick a number 0,1,2,3,…,7 Answer the following questions truthfully Q1. Is your number 4,5,6,7? Q2. Is your number 2,3,6,7? Q3. Is your number 1,3,5,7?

Binary numbers 0 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1

3 Bit Binary Number: x x represented by three bits a b c eg. 101 a,b,c are 0 or 1 x = 22a + 2b + c eg. 101 = 4+0+1 = 5 011 = 0+2+1 = 3

Binary numbers 0 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1

1, 0 are called bits of information All information in a computer is made up of bits Usually binary numbers have more than 3 bits eg. 10011011 has 8 bits A message of 8 bits is called a byte Letters are converted into bytes

How does a monster count to 25? On his fingers! Using binary you can count from 0 to 31 on one hand with 5 bit binary numbers eg. 10110 = 16 + 4 + 2 = 22 11001 = 16 + 8 + 1 = 25

How to catch a liar. Sometimes we make mistakes Mean to send 1110011 Make a mistake on one bit and send 1110111 Can we tell if we have made a mistake?

Answer the following questions. Either tell the truth or lie at most once Pick a number between 0 and 7 Q1 Is it 4,5,6,7? Q2 Is it 2,3,6,7? Q3 Is it 1,3,5,7? Q4 Is it 1,2,4,7? Can we find the liar?

0 0 0 0 0 0 0 1 1 0 1 0 1 0 1 1 0 answer to last question 1 0 0 1 1 0 1 0 1 1 0 0 1 1 1 1 If all true there are an: even number of 1s If one lie there is an: odd number of 1s Last digit/question is called a parity bit and tells us if we have made a mistake

How to lie and get away with it! Suppose that we make a mistake Can we detect it …. And … Correct it

Answer the following questions Answer the following questions .. You can either tell the truth or lie at most once Choose a number 0,1,2,3,4,5,6,7 Q1 Is the number 4,5,6,7? Q2 Is the number 2,3,6,7? Q3 Is the number 1,3,5,7? Q4 Is the number 1,3,4,6? Q5 Is the number 1,2,5,6? Q6 Is the number 2,3,4,5?

0 000 000 1 001 110 2 010 011 3 011 101 4 100 101 5 101 011 6 110 110 7 111 000 Binary number Correcting number

Start with a binary number 110110 Telling the truth doesn’t change the number 110110 Lying once changes the number by one digit 100110 Hamming Distance: Take two binary numbers. How many digits do we have to change to turn one into the other?

110110 110110 1 1 110111 2 100110 3 3 110000

Making an error changes the original binary number by one Hamming distance 110111 010110 110100 110110 100110 110010 111110

Idea: Choose a code of binary numbers 3 Hamming distances apart Any error is then always closer to the original number than to any other number

0 000 000 1 001 110 2 010 011 3 011 101 4 100 101 5 101 011 6 110 110 7 111 000 All are a Hamming distance of 3 apart Binary number Correcting number

Error correcting codes. Used to store the numbers 0,1,2,3,4,5,6,7 in such a way that any errors can not only be detected but corrected.

These are used in IPODs IPOD also compresses the information.

For example Instead of sending this message which has lots of vowels in it which we don’t really need W cn snd ths mssg nstd whch ds nt hv ny vwls t ll Nw try ths fr yrslf