Coding Theory for the Classroom? Josef Böhm Mathe mit Gewinn 2, Textbook for College for Business Administration (= HAK = Handelsakademie)

Slides:



Advertisements
Similar presentations
STATISTIC & INFORMATION THEORY (CSNB134) MODULE 12 ERROR DETECTION & CORRECTION.
Advertisements

Applied Algorithmics - week7
Michael Alves, Patrick Dugan, Robert Daniels, Carlos Vicuna
Computer Science 101 Data Encryption And Computer Networks.

Huffman Encoding Dr. Bernard Chen Ph.D. University of Central Arkansas.
Lecture 10 : Huffman Encoding Bong-Soo Sohn Assistant Professor School of Computer Science and Engineering Chung-Ang University Lecture notes : courtesy.
Data Compressor---Huffman Encoding and Decoding. Huffman Encoding Compression Typically, in files and messages, Each character requires 1 byte or 8 bits.
Numbers in Codes GCNU 1025 Numbers Save the Day. Coding Converting information into another form of representation (codes) based on a specific rule Encoding:
MAT 1000 Mathematics in Today's World Winter 2015.
Lossless Data Compression Using run-length and Huffman Compression pages
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.
Spring 2015 Mathematics in Management Science Binary Linear Codes Two Examples.
PrasadDigital Roots1 VEDIC MATHEMATICS : Digital Roots/Sums T. K. Prasad
Huffman code uses a different number of bits used to encode characters: it uses fewer bits to represent common characters and more bits to represent rare.
Chapter 16: Identification Numbers Lesson Plan
© All Rights Reserved Barcodes How does a barcode reader work?
Huffman Codes Message consisting of five characters: a, b, c, d,e
Dale & Lewis Chapter 3 Data Representation
Chapter 17: Information Science Lesson Plan Binary Codes Encoding with Parity-Check Sums Cryptography Web Searches and Mathematical Logic 1 Mathematical.
Session 11: Coding Theory II
Cryptography Programming Lab
Algorithm Design & Analysis – CS632 Group Project Group Members Bijay Nepal James Hansen-Quartey Winter
Chapter 17: Information Science Lesson Plan
Wong Wai Ling, Lam Pui Ki Identification number  clearly identify a person or a thing Check digit  an extra digit for the purpose of error.
MA/CSSE 473 Day 31 Student questions Data Compression Minimal Spanning Tree Intro.
Fault Tolerance CDA 5140 Spring 06 Everyday FT. Background Use of check digits for error detection on everyday applications used extensively but most.
Lecture 12.  The ISBN 10-digit uses a reverse weighting system: multiply the first digit by 10, the second by 9, the third by 8 and so on until the check.
1 Huffman Codes Drozdek Chapter Objectives You will be able to Construct an optimal variable bit length code for an alphabet with known probability.
 The amount of data we deal with is getting larger  Not only do larger files require more disk space, they take longer to transmit  Many times files.
COEN 180 Erasure Correcting, Error Detecting, and Error Correcting Codes.
Error Detection and Correction
§6 Linear Codes § 6.1 Classification of error control system § 6.2 Channel coding conception § 6.3 The generator and parity-check matrices § 6.5 Hamming.
Additive White Gaussian Noise
Joseph Kirtland Department of Mathematics Marist College
Bahareh Sarrafzadeh 6111 Fall 2009
FEC Linear Block Coding
Math for Liberal Studies. What is an identification number?  An identification number is a sequence of digits and/or numbers that identifies an object,
Lecture 12 Huffman Algorithm. In computer science and information theory, a Huffman code is a particular type of optimal prefix code that is commonly.
بسم الله الرحمن الرحيم My Project Huffman Code. Introduction Introduction Encoding And Decoding Encoding And Decoding Applications Applications Advantages.
Huffman encoding.
Chapter Nine: Data Transmission. Introduction Binary data is transmitted by either by serial or parallel methods Data transmission over long distances.
Genetic Algorithms and Evolutionary Programming A Brief Overview.
Coding and Error Control
Binary Representation in Text
Binary Representation in Text
8 Coding Theory Discrete Mathematics: A Concept-based Approach.
Dr. Clincy Professor of CS
The Mathematics of Star Trek Workshop
Madivalappagouda Patil

Chapter 16: Introduction
Arithmetic coding Let L be a set of items.
Huffman Encoding Visualization
Advanced Algorithms Analysis and Design
Chapter 11 Data Compression
Standard Array.
Fundamentals of Data Representation
Huffman Encoding Huffman code is method for the compression for standard text documents. It makes use of a binary tree to develop codes of varying lengths.
Chapter Nine: Data Transmission

Data Structure and Algorithms
Greedy Algorithms Alexandra Stefan.
Chapter 16: Check Digit Systems, Continued
File Compression Even though disks have gotten bigger, we are still running short on disk space A common technique is to compress files so that they take.
Huffman Encoding.
Huffman Coding Greedy Algorithm
Lecture 17 Making New Codes from Old Codes (Section 4.6)
Chapter 17: Information Science Lesson Plan
Presentation transcript:

Coding Theory for the Classroom? Josef Böhm Mathe mit Gewinn 2, Textbook for College for Business Administration (= HAK = Handelsakademie) All files are available on request. The respective chapter has been translated. See the pdf-file.

 Mathematics in Codes of everday life: ISBN, EAN, UPC, Credit Cards, Social Insurance Number, ….  Data Compressing Huffman Code  Error Correcting Codes Hamming Code

International Herald Tribune, June 27-28, 2009

Old ISBN and new ISBN: Simon Singh: “The Code Book“ 10*1+9*8+ …+2*9 = wS 11-mod(wS,11) = check digit 1*9+3*7+1*8 …+3*9 = wS 10-mod(wS,10) = check digit

Single errors and phonetic errors are recognized. Prove the detection of phonetic errors (13  30; 14  40; …) EAN Code = UPC 13

Shift 1,n and n,0 by one digit and repeat the calculation.

ISBN and

Data Compressing The Huffman Code

“dieser text wird verwendet“

110|0011|011|00010| results in: dies...

freq(text) returns a frequency table of the characters contained in text huffcode(text,code) encodes the string text applying the Huffman-Code connected with this string. The code is given as a 2n-matrix (1st row: characters, 2nd row: code words). huffdecode(codtxt,code) decodes the encoded plain text codtxt, which was encoded applying code. hufftree(text) = Program for automatic generating a code for message plain. Because the code is part of the encoded message, it will be returned. He will be used for the final encoding of the message - and then for decoding. Entering 1 as second parameter presents how the Code develops (Nodes-weights and branches). hufftree2(text) has a tighter code. Because of the slight change in the structure of the lists nodes with same weights are sorted in another way. The resulting code is also optimal. All texts and code words are strings – must be entered in quotes! ("text")

Error Correcting Codes The Hamming Code

Hamming Code

Hamming Code and DERIVE hammdist(word1, word2) gives the Hamming distance of two code words. hamcode(text) gives the encoded text. (Use only Uppercase letters and punctuation characters. hamdecode(codeword) returns the codeword entered, its error free version in case of a transmission error and the decoded value. full_hamdecode(encoded text)