Error Correcting Codes: Combinatorics, Algorithms and Applications CSE 545 January 11, 2010.

Slides:



Advertisements
Similar presentations
CS112: Course Overview George Mason University. Today’s topics Go over the syllabus Go over resources – Marmoset – Blackboard – Piazza – Textbook Highlight.
Advertisements

Error Correcting Codes: Combinatorics, Algorithms and Applications CSE 510C August 27, 2006.
Lecture 40 CSE 331 Dec 11, Announcements Solutions to HW 10 and graded HW 9 at end of the lecture Review session on Monday: see blog for details.
CSE 501 Research Overview Atri Rudra
Lecture 41 CSE 331 Dec 10, HW 10 due today Q1 in one pile and Q 3+4 in another I will not take any HW after 1:15pm.
CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University.
CS 201: Introduction To Programming With Java
CSE 501 Research Overview Atri Rudra
CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University.
Error Correcting Codes: Combinatorics, Algorithms and Applications CSE 545 January 19, 2011.
COMP 110 Introduction to Programming Mr. Joshua Stough August 22, 2007 Monday/Wednesday/Friday 3:00-4:15 Gardner Hall 307.
COMP 14 – 02: Introduction to Programming Andrew Leaver-Fay August 31, 2005 Monday/Wednesday 3-4:15 pm Peabody 217 Friday 3-3:50pm Peabody 217.
Introduction to Programming Environments for Secondary Education CS 1140 Dr. Ben Schafer Department of Computer Science.
COP4020/CGS5426 Programming languages Syllabus. Instructor Xin Yuan Office: 168 LOV Office hours: T, H 10:00am – 11:30am Class website:
Computer Science 102 Data Structures and Algorithms V Fall 2009 Lecture 1: administrative details Professor: Evan Korth New York University 1.
CS 450: COMPUTER GRAPHICS COURSE AND SYLLABUS OVERVIEW SPRING 2015 DR. MICHAEL J. REALE.
MATH 310, FALL 2003 (Combinatorial Problem Solving) MoWeFr 1:20 McGregory 214.
Welcome to CS 3260 Dennis A. Fairclough. Overview Course Canvas Web Site Course Materials Lab Assignments Homework Grading Exams Withdrawing from Class.
COMP Introduction to Programming Yi Hong May 13, 2015.
1 COMS 161 Introduction to Computing Title: Course Introduction Date: August 25, 2004 Lecture Number: 1.
Prof. Matthew Hertz SH 1029F /
About Me Jesse Hartloff, PhD Office: 203 Davis (may change) Office hours: TBD.
Lecture 1: Introduction CS 6903: Modern Cryptography Spring 2009 Nitesh Saxena Polytechnic Institute of NYU.
How to be an online student. How does it work? An online course follows a schedule and syllabus with due dates for assignments (just like an on-campus.
Error Correcting Codes: Combinatorics, Algorithms and Applications CSE 545 January 14, 2013.
Prof. Matthew Hertz WTC 207D /
Let’s do some introductions
CSCI 51 Introduction to Computer Science Dr. Joshua Stough January 20, 2009.
Welcome to CS 115! Introduction to Programming. Class URL Write this down!
1 Principles of Computer Science I Note Set 1 CSE 1341.
Introduction to Data Structures
Computer Science 102 Data Structures and Algorithms CSCI-UA.0102 Fall 2012 Lecture 1: administrative details Professor: Evan Korth New York University.
Let’s do some introductions
ICS 6B Boolean Algebra and Logic Winter 2015
MAT 360 – Lecture 0 Introduction. About me  Moira Chas   Work phone :  Office Location:
Fall 2o12 – August 27, CMPSC 202 First Day Handouts  Syllabus  Student Info  Fill out, include all classes and standard appointments  Return.
CS 858 – Hot Topics in Computer and Communications Security Winter 2009 Introduction.
Principles of Computer Science I Honors Section Note Set 1 CSE 1341 – H 1.
Internet Economics כלכלת האינטרנט Class 12 – Preparing for the second semester. 1.
LISA A. TOBLER, M.S. Introduction to Psychology PS124 Seminar #1.
Welcome to the MTLC MATH 115 Spring MTLC Information  Hours of Operation  Sunday:4:00pm – 10:00pm  Monday – Thursday: 8:00am – 10:00pm  Friday:8:00am.
1 CNT 4704 Analysis of Computer Communication Networks Cliff Zou Department of Electrical Engineering and Computer Science University of Central Florida.
ICS202 Data Structures King Fahd University of Petroleum & Minerals College of Computer Science & Engineering Information & Computer Science Department.
COP4610/CGS5765 Operating Systems Syllabus. Instructor Xin Yuan Office: 168 LOV Office hours: W M F 9:10am – 10:00am, or by appointments.
 READING FOR COLLEGE SUCCESS. Who Am I? Why Are You Here?  This course is a half credit course that will count for your online graduation requirement.
CMSC 2021 CMSC 202 Computer Science II for Majors Spring 2002 Sections Ms. Susan Mitchell.
Computer Science, FSU1 CNT5505 DATA/COMUTER COMMUNICATIONS Fall 2010.
CS151 Introduction to Digital Design Noura Alhakbani Prince Sultan University, College for Women.
BIT 143: Programming – Data Structures It is assumed that you will also be present for the slideshow for the first day of class. Between that slideshow.
Welcome to Astronomy 113 “ It would seem that you have no useful skill or talent whatsoever, he said.
Research Experience Program (REP) Spring 2008 Psychology 100 Ψ.
CS112: Course Overview George Mason University. Today’s topics Go over the syllabus Go over resources – Marmoset – Blackboard – Piazza – Textbook Highlight.
Data Structures and Algorithms in Java AlaaEddin 2012.
About Me Jesse Hartloff Office: 203 Davis Office hours: TBD.
Lecture 20 CSE 331 July 30, Longest path problem Given G, does there exist a simple path of length n-1 ?
Research Experience Program (REP) Fall 2007 Psychology 100 Ψ.
CIT 592 Discrete Math Lecture 1. By way of introduction … Arvind Bhusnurmath There are no bonus points for pronouncing my last name correctly Please call.
PROBLEM SOLVING AND PROGRAMMING ISMAIL ABUMUHFOUZ | CS 170.
INTRODUCTION TO COLLEGE WRITING Writing Workshop September 24 & 25, 2015.
Computer Science I ISMAIL ABUMUHFOUZ | CS 180. CS 180 Description BRIEF SUMMARY: This course covers a study of the algorithmic approach and the object.
Welcome to Introduction to Psychology! Let’s share a bit about where we are all from…
Networking CS 3470, Section 1 Sarah Diesburg
Computer Science 102 Data Structures CSCI-UA
Welcome to CS 1010! Algorithmic Problem Solving.
Welcome to CS 1340! Computing for scientists.
Welcome to CS 1010! Algorithmic Problem Solving.
Tonga Institute of Higher Education IT 141: Information Systems
Tonga Institute of Higher Education IT 141: Information Systems
CS 232 Geometric Algorithms: Lecture 1
Presentation transcript:

Error Correcting Codes: Combinatorics, Algorithms and Applications CSE 545 January 11, 2010

Let’s do some introductions Atri Rudra  123 Bell Hall    Office hours: By Appointment

Handouts for today Syllabus Feedback form  Also fill in the sheet being passed around with your name/

Plug for feedback forms Completing the form is voluntary & anonymous Purpose of the form  Fix number of homeworks  For me to get an idea of your technical background Last 5 minutes of the lecture to complete it

Course webpage

Course blog ( codingtheory.wordpress.com ) Used for announcements YOU are responsible for checking the blog for updates

Why use a blog? Easy access Easier to link to URLs and displaying math

What will appear on the blog? An entry for each lecture/homework  Comments section to ask questions or post comments A post on some interesting side story/comment

Other stuff on the blog

Questions/Comments? If something is broken on the blog (e.g. you cannot post a comment), let me know

Makeup classes Some classes will be canceled  I will be traveling  1 class for now Need one 50 mins makeup lecture  Indicate your preferences in the feedback form January 15 class is cancelled

References No text book Main source: Notes from Fall 07 course  Links on the course blog/webpage Standard coding theory texts  MacWilliams and Sloane  van Lint  Blahut  Handbook of coding theory

Pre-requisites No formal pre-requisites  Probably no one will have all the pre-req’s Mathematical maturity  Comfortable with proofs  Willing to pick up basics of new areas Will spend one lecture on the pre-req’s  Linear Algebra  Finite Fields  Probability  Algorithms/ Asymptotic Analysis Go slower in the first half of the course

Grades and such like Scribing/Proof-reading notes  30-40% Homework(s)  40-25% Updating Wikipedia  30-35%

Updating Wikipedia You need a choose a coding theory topic  Either the entry is not present or the entry is “bare-bones”

More details Deadlines  March 22: Let me know your choice  March 29: Submit one page “report” on what you intend to do  April 19: Submit your final version in the in-house wiki  More details in the syllabus

In-house wiki You get to play on an in-house Wiki  You will need some LaTeX knowledge

Scribing notes Some lecture notes will be scribed by a student (maybe give some extra details) At most once during the course Use LaTeX  Style file on the webpage They are due in a week Notes will be graded on timeliness & quality See syllabus for more details

Proof-reading notes Proof-read existing notes 6-7during the course  Depends on the class strength me typos, suggestions for improvement They are due in by noon before next lecture Notes will be graded on timeliness & quality Will ask for a volunteer See syllabus for more details

Questions/Comments? Check out the syllabus for more details

Homework 1 or 3 depending on your choice Collaboration generally allowed  Work in groups of size at most 3  Write up your own solutions  Acknowledge your collaborators  No source other than lecture notes  Breaking these rules will be considered as cheating More details when they are handed out

My homework philosophy for 545 NOT to make sure you understand what I teach in the lectures Homework problems either  Proofs that were not done in the class; or  Material that is not covered in the class Closely related to something that is

Questions/Comments? Check out the syllabus for more details

Some comments Decide on a Wikipedia topic early  Different topics might need different prep. work  Come talk to me Homeworks might take time  Do not wait for the last moment

Some of my teaching “quirks” Neighbor talk time Periodic feedback forms

Academic Dishonesty All your submissions must be your own work Penalty:  Minimum: zero credit on the particular assignment  Highly likely: An F grade  Possible: F “due to academic dishonesty” on your transcript YOUR responsibility to know what is cheating, plagarism etc.  If not sure, come talk to me Excuses like “I have a job,” “This was OK earlier/in my country,” etc. WON’T WORK

If grades are all you care about You’ll be fine if  You do your assignments with honesty  Make a reasonable attempt at them

Questions/Comments? Check out the syllabus for more details

Let the fun begin!

Coding theory

What does this say? W*lcome to the cl*ss. I h*pe you w*ll h*ve as mu*h f*n as I wi*l hav* t*ach*ng it! Welcome to the class. I hope you will have as much fun as I will have teaching it!

Why did the example work? English has in built redundancy Can tolerate “errors”

The setup C(x) x y = C(x)+error x Give up Mapping C  Error-correcting code or just code  Encoding: x  C(x)  Decoding: y  x  C(x) is a codeword

Communication Internet  Checksum used in multiple layers of TCP/IP stack Cell phones Satellite broadcast  TV Deep space telecommunications  Mars Rover

“Unusual” applications Data Storage  CDs and DVDs  RAID  ECC memory Paper bar codes  UPS (MaxiCode) Codes are all around us

Other applications of codes Outside communication/storage domain Tons of applications in theory  Complexity Theory  Cryptography  Algorithms

The birth of coding theory Claude E. Shannon  “A Mathematical Theory of Communication”  1948  Gave birth to Information theory Richard W. Hamming  “Error Detecting and Error Correcting Codes”  1950

Structure of the course Part I: Combinatorics  What can and cannot be done with codes Part II: Algorithms  How to use codes efficiently Part III: Applications  Applications in (theoretical) Computer Science

The fundamental tradeoff Correct as many errors as possible while using as little redundancy as possible  Intuitively, contradictory goals