Joint Mathematics Meetings Program by Special Session

Current as of Thursday, January 15, 2009 00:44:10

Joint Mathematics Meetings
Washington, DC, January 5-8, 2009 (Monday - Thursday)
Meeting #1046

• Monday January 5, 2009, 8:00 a.m.-10:50 a.m.
  AMS Special Session on Recent Trends in Coding Theory, I
  Balcony D, Mezzanine Level, Marriott
  Organizers:
  Gretchen L. Matthews, Clemson University gmatthe@clemson.edu
  Judy L. Walker, University of Nebraska
  

  • 8:00 a.m.
    Generalizing Binary Quadratic Residue Codes.
    P. Charters*, University of Texas at Austin, Mathematics Department
    (1046-11-645)
  • 8:25 a.m.
    Locally decodable codes.
    Sergey Yekhanin*, Microsoft Research
    (1046-68-951)
  • 8:50 a.m.
    Iterative Subspace Pursuit Decoding of Weighted Euclidean Superimposed Codes.
    Wei Dai*, University of Illinois at Urbana-Champaign
    Olgica Milenkovic, University of Illinois at Urbana-Champaign
    (1046-68-1510)
  • 9:15 a.m.
    On algebraic constructions of codes for random linear network coding.
    Felice Manganiello*, Zurich University
    Elisa Gorla, Zurich University
    Joachim Rosenthal, Zurich University
    (1046-94-854)
  • 9:40 a.m.
    Further analysis of codes based on permutations.
    Christine A Kelley*, University of Nebraska-Lincoln
    (1046-94-1960)
  • 10:05 a.m.
    Coding theory and Pseudorandomness.
    Venkatesan Guruswami*, University of Washington & Carnegie Mellon University
    (1046-05-1085)
• Monday January 5, 2009, 2:15 p.m.-6:50 p.m.
  AMS Special Session on Recent Trends in Coding Theory, II
  Balcony D, Mezzanine Level, Marriott
  Organizers:
  Gretchen L. Matthews, Clemson University gmatthe@clemson.edu
  Judy L. Walker, University of Nebraska
  

  • 2:15 p.m.
    On decoding multipoint algebraic geometry codes.
    Nathan Drake*, Clemson University
    (1046-14-1768)
  • 2:40 p.m.
    Efficient List Decoding of Explicit Codes with Optimal Redundancy.
    Atri Rudra*, University at Buffalo, The State University of New York
    (1046-68-464)
  • 3:05 p.m.
    Trellis Pseudocodewords.
    Deanna Dreher*, University of Nebraska
    (1046-94-1612)
  • 3:30 p.m.
    LDPC codes and Ramanujan graphs.
    Chenying Wang*, Penn. State Univ.
    (1046-15-1807)
  • 3:55 p.m.
    On right-regular graphs for cascaded LDPC codes.
    Abigail G. Mitchell*, University of Zürich
    (1046-94-2012)
  • 4:20 p.m.
    Golay, Heisenberg and Weyl.
    Robert Calderbank*, Princeton University
    (1046-94-465)
  • 5:15 p.m.
    On the Growth Rate of the Weight Distribution of Irregular Doubly-Generalized LDPC Codes.
    Mark F. Flanagan*, University of Zurich, Switzerland
    Enrico Paolini, University of Bologna, Italy
    Marco Chiani, DEIS, University of Bologna, Italy
    Marc P.C. Fossorier, ETIS ENSEA / UCP / CNRS UMR-8051, Cergy Pontoise, France
    (1046-94-841)
  • 5:40 p.m.
    Enumerating Pseudo-codewords in Fundamental Cones.
    Min Lu*, University Park, PA
    (1046-94-1490)
  • 6:05 p.m.
    Extrinsic Tree Decoding of LDPC Codes.
    Eric Thomas Psota*, University of Nebraska-Lincoln
    (1046-94-1540)
  • 6:30 p.m.
    Polytope Representations for Linear-Programming Decoding of Nonbinary Linear Codes.
    Mark F. Flanagan, Universitat Zurich
    Vitaly Skachek*, Claude Shannon Institute, University College Dublin
    Eimear Byrne, University College Dublin
    Marcus Greferath, University College Dublin
    (1046-94-685)