1 / 39

Error Correcting Codes: Combinatorics, Algorithms and Applications

Error Correcting Codes: Combinatorics, Algorithms and Applications. CSE 545 January 11, 2010. Let’s do some introductions. Atri Rudra 123 Bell Hall atri@buffalo.edu 645-2464 Office hours: By Appointment. Handouts for today. Syllabus Feedback form

eudora
Download Presentation

Error Correcting Codes: Combinatorics, Algorithms and Applications

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

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

  2. Let’s do some introductions • Atri Rudra • 123 Bell Hall • atri@buffalo.edu • 645-2464 • Office hours: By Appointment

  3. Handouts for today • Syllabus • Feedback form • Also fill in the sheet being passed around with your name/email

  4. 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

  5. Course webpage http://www.cse.buffalo.edu/~atri/courses/coding-theory/

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

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

  8. 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

  9. Other stuff on the blog

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

  11. 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

  12. 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

  13. 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

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

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

  16. 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

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

  18. 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

  19. Proof-reading notes • Proof-read existing notes • 6-7during the course • Depends on the class strength • Email 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

  20. Questions/Comments? • Check out the syllabus for more details

  21. 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

  22. 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

  23. Questions/Comments? • Check out the syllabus for more details

  24. 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

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

  26. 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

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

  28. Questions/Comments? • Check out the syllabus for more details

  29. Let the fun begin!

  30. Coding theory http://catalyst.washington.edu/

  31. 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!

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

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

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

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

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

  37. 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

  38. 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

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

More Related