December 18, 2006.ppt

December 18, 2006 ? 2006 TANGRAM Coding Theory: Packing, Covering, and 2-Player Games Robert Ellis Menger Day 2008: Recent Applied Mathematics Research Advances April 14, 2008 Overview A problem from integrated circuit design Coding Theory Error-correcting codes and packings Error-correcting codes as a 2-player liar game Covering codes Covering codes as a football pool Coding with Feedback A liar game and an adaptive football pool Near-perfect radius 1 adaptive codes Results and Research Questions in Liar Games A VLSI Layout Problem An Asymmetric Covering Code Fill library ? (6,2)-asymmetric binary code Size bound ?(2n/nR) (Cooper,Ellis,Kahng `02) Application to VLSI Layout(Ellis,Kahng,Zheng `03) Improved fixed-parameter codes: Applegate,Rains,Sloane `03; Exoo `04; ?sterg?rd,Seuranen `04 Improved size bound (Krivelevich,Sudakov,Vu `03) Smallest (4,1)-Asymmetric Covering Code Therefore K+(4,2) = 6 (length=4, radius=2). Good (n,R)-Asymmetric Covering Codes Select each word to be inthe code with probability p(n) Any uncovered word isadded as a codeword This plus hypercube structureyields codes of size ?(2n/nR) Best possible up to a constant,since middle ball volumes are?(nR) Coding Theory Overview Coding theory concerns the properties of sets of codewords, or fixed-length strings from a finite alphabet. Primary uses: Error-correction for transmission in the presence of noiseCompression of data with or without loss Many viewpoints afforded:Packings and coverings of Hamming balls in the n-cube2-player perfect information games Information Theory (Shannon Model) Coding Theory: (n,e)-Codes Block Codes from now on Restricting to block codes still includes Convolutional codes (cell phones, Bluetooth) Reed-Solomon codes (CDs, DSL, WiMAX) Turbo codes (Mars Reconnaissance Orbiter) (assumptions on noise for these codes will vary) Coding Theory – A Hamming (7,1)-Code A Repetition Code as a Packing (3,1)-code: 111, 000 Pai