MAT 1000 Mathematics in Today's World Winter 2015.

Slides:



Advertisements
Similar presentations
Mahdi Barhoush Mohammad Hanaysheh
Advertisements

Cyclic Code.
Applied Algorithmics - week7
Error Control Code.
10.1 Chapter 10 Error Detection and Correction Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Information and Coding Theory
Error Correcting Codes Stanley Ziewacz 22M:151 Spring 2009.
Math for Liberal Studies.  Problems can occur when data is transmitted from one place to another  The two main problems are  transmission errors: the.
NETWORKING CONCEPTS. ERROR DETECTION Error occures when a bit is altered between transmission& reception ie. Binary 1 is transmitted but received is binary.
Chapter 10 Error Detection and Correction
The Voting Game How do we overcome transmission errors?
Error detection and correction
MAT 1000 Mathematics in Today's World Winter 2015.
Error Detection and Correction
The Mathematics of Star Trek Data Transmission Michael A. Karls Ball State University.
Hamming Code Rachel Ah Chuen. Basic concepts Networks must be able to transfer data from one device to another with complete accuracy. Data can be corrupted.
Hamming Code A Hamming code is a linear error-correcting code named after its inventor, Richard Hamming. Hamming codes can detect up to two bit errors,
Hamming It Up with Hamming Codes CSE 461 Section Week 3.
Error Detection and Correction.  Corrupted files  Attachments that won’t open  Files that won’t download  Videos that won’t play Errors occur when.
Mathematics in Management Science
The Mathematics of Star Trek
Information Coding in noisy channel error protection:-- improve tolerance of errors error detection: --- indicate occurrence of errors. Source.
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.
British Computer Society
CODING/DECODING CONCEPTS AND BLOCK CODING. ERROR DETECTION CORRECTION Increase signal power Decrease signal power Reduce Diversity Retransmission Forward.
Error Control Code. Widely used in many areas, like communications, DVD, data storage… In communications, because of noise, you can never be sure that.
10.1 Chapter 10 Error Detection and Correction Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
COEN 180 Erasure Correcting, Error Detecting, and Error Correcting Codes.
Chapter 10. Error Detection and Correction
Cyclic Redundancy Check CRC Chapter CYCLIC CODES Cyclic codes are special linear block codes with one extra property. In a cyclic code, if a codeword.
ENEE244-02xx Digital Logic Design Lecture 3. Announcements Homework 1 due next class (Thursday, September 11) First recitation quiz will be next Monday,
Introduction to Coding Theory. p2. Outline [1] Introduction [2] Basic assumptions [3] Correcting and detecting error patterns [4] Information rate [5]
Unit 5 Lecture 2 Error Control Error Detection & Error Correction.
Error Detection and Correction
DIGITAL COMMUNICATIONS Linear Block Codes
Chapter 31 INTRODUCTION TO ALGEBRAIC CODING THEORY.
Information Theory Linear Block Codes Jalal Al Roumy.
Word : Let F be a field then the expression of the form a 1, a 2, …, a n where a i  F  i is called a word of length n over the field F. We denote the.
Verification & Validation. Batch processing In a batch processing system, documents such as sales orders are collected into batches of typically 50 documents.
Error Detection and Correction
VLSI AND INTELLIGENT SYTEMS LABORATORY 12 Bit Hamming Code Error Detector/Corrector December 2nd, 2003 Department of Electrical and Computer Engineering.
CHAPTER 3: DATA LINK CONTROL Flow control, Error detection – two dimensional parity checks, Internet checksum, CRC, Error control, Transmission efficiency.
10.1 Chapter 10 Error Detection and Correction Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
10.1 Chapter 10 Error Detection and Correction Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
10.1 Chapter 10 Error Detection and Correction Data can be corrupted during transmission. Some applications require that errors be detected and.
Basic Concepts of Encoding Codes and Error Correction 1.
Cryptography and Coding Theory
10.1 Chapter 10 Error Detection and Correction Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
10.1 Chapter 10 Error Detection and Correction Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
1 Product Codes An extension of the concept of parity to a large number of words of data 0110… … … … … … …101.
Hamming (4,7) Code Binary Linear Codes Hamming Distance Weight of BLC
The Mathematics of Star Trek Workshop
Error Detection and Correction
DATA COMMUNICATION AND NETWORKINGS
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.
Chapter 10 Error Detection And Correction
Error Detection Bit Error Rate(BER): It is the ratio of number Ne of errors appearing over a certain time interval t to the number Nt of 1 and 0 pulses.

Chapter 10 Error Detection And Correction
MAT 105 Spring 2008 Chapter 17: Binary Codes.
II. Linear Block Codes.
EET107/3 DIGITAL ELECTRONICS 1
Information Redundancy Fault Tolerant Computing
Error Detection and Correction
Communicating Efficiently
Error Detection and Correction
How to lie and get away with it
Types of Errors Data transmission suffers unpredictable changes because of interference The interference can change the shape of the signal Single-bit.
Lecture 17 Making New Codes from Old Codes (Section 4.6)
Theory of Information Lecture 13
Presentation transcript:

MAT 1000 Mathematics in Today's World Winter 2015

Last Time We looked at ways to add extra digits to a binary code, allowing us to catch and correct errors. One example used Venn diagrams to encode four digit messages. More generally, we can use “parity check sums.” With these, we can have messages of any length, and we can catch or correct more errors

Today For any parity check sum encoding system, we can determine how many errors it will correct or detect.

Binary linear codes A binary linear code is a set of strings of 0’s and 1’s obtained from all messages of a given length by using parity check sums to add digits. The resulting strings of 0’s and 1’s are called code words.

Binary linear codes Example Last class we constructed the following example: This is a binary linear code. The right column are the code words. For example: is a code word.

Error detection and correction capacity For any binary linear code, we can determine how many errors it will detect or correct. We call these numbers the “error detection capacity” and the “error correction capacity.” These can be determined once we know the “weight” of a binary linear code. The weight of a binary code is the smallest number of 1’s that appear in a code word (except a code word which is all 0’s)

Error detection and correction capacity In the example from last class, we had the following code words: This binary code has weight 3. Code words Number of 1’s

Error detection and correction capacity

What does “detecting errors at most 2 errors” mean? We have to decide in advance that we will reject any message which does not match a code word (that we will not try to correct errors). If we do, then as long as a message has 2 or fewer errors, we will always notice.

Error detection and correction capacity For example, if we receive the message Incorrectly as (two errors: in the second and fifth place), we notice, because isn’t a code word. On the other hand, if we receive incorrectly as (three errors, in the second, third and fifth places) we won’t notice, because is a code word.

Error detection and correction capacity

What does “correcting at most 1 error” mean? We must decide in advance that if a message doesn’t match any code word, then we will decode it (using nearest neighbor decoding). As long as the message received has only 1 error, we will decode it correctly. However, if there are 2 or more errors, we may decode it incorrectly.

Error detection and correction capacity Suppose we have decided to attempt to decode all messages. If we are sent the message But we receive it with one error as 100 Then it will decode correctly.

Error detection and correction capacity Decode using nearest neighbor decoding. The closest message is the correct one: Distance Code Words

Error detection and correction capacity On the other hand, if a message has two or more errors, it may not decode correctly. For example, suppose we receive the message Incorrectly as Let’s decode this message

Error detection and correction capacity Decode using nearest neighbor decoding. We decode this message incorrectly as The correct message was Distance Code Words

Error detection and correction capacity

Example The code words for the Venn diagram system are: The smallest number of 1’s in any of these is 3. So this code also has weight 3.

Error detection and correction capacity Example Since the Venn diagram system has weight 3, it will either: 1.Detect 2 errors 2.Correct 1 error

Error detection and correction capacity When designing a binary linear code, the higher the weight, the more errors can be detected or corrected. So when we choose which parity check sums to use, we should pick the ones that give our code the highest weight.