Dept. of Math., Univ. of Hawaii

Mathematical Coding and Information Theory

A Special Session

of the American Mathematical Society Sectional Meeting

March 22-24, 2019 University of Hawaii, Manoa, Honolulu

Organized by J. B. Nation (University of Hawaii) and Manabu Hagiwara (Chiba University, Japan)

Invited talks at an AMS special session are generally 20 minutes in length, with an additional 10 minutes for questions and discussion. Abstracts should be submitted to the AMS through the link above. The official, absolute deadline for abstracts is January 29, 2019. Sooner is better: we will try to set the program in late December.
The University of Hawaii is in Manoa valley, about a mile towards the mountains from Waikiki. TheBus service to the university is good; a daily bus pass for unlimited rides on the island costs $5.50.
We will add more travel information when it becomes available from the meeting organizers.
A special session at the Hawaii meeting will provide an excellent opportunity to strengthen connections between mathematicians working in coding theory and information theory, from the United States and Japan. There is a long history of collaboration between the University of Hawaii and Japan in coding theory, going back to the 1960s. We would like to promote this cooperation, and extend it to include more mathematicians from the mainland. This special session will also provide a chance to establish connections between pure and applied mathematicians in both countries.
The emphasis of the session would be on recent information theory and coding theory, for examples, deletion and insertion codes, applications of algebraic codes, mathematical approach for coding theory, non-asymptotic information theory, data compression, and so on. The mathematics of designing and analyzing these types of codes involves graph theory, combinatorics, designs, linear programming, reflection groups, algebraic geometry, applied algebra and number theory. A mathematical approach to these codes is inherently interesting, but also an important step in determining the applicability of these codes to practical and industrial settings.
Organizers: J. B. Nation (University of Hawaii) and Manabu Hagiwara (Chiba University, Japan)
Contact: jb@math.hawaii.edu, hagiwara@math.s.chiba-u.ac.jp
Invited speakers include:
  • Sarah E. Anderson* (U. of St. Thomas), Ann Johnston, Gauri Joshi, Gretchen L. Matthews, Carolyn Mayer, Emina Soljanin: Service Rate Region of Coded Storage Systems.
  • Khodakhast Bibak*(Miami U.), Olgica Milenkovic: Explicit Formulas for the Weight Enumerators of Some Classes of Deletion Correcting Codes.
  • Samuel Birns* (U. of Hawaii): Formalization of Levenshtein Codes.
  • Yuichiro Fujiwara*(Chiba U.): Parity-check matrices for error-erasure separation and X-codes.
  • Ryan C Gabrys*(SPAWAR Systems Center): Set-Codes with Small Intersections and Small Discrepancies.
  • Manabu Hagiwara*(Chiba U.): Weyl Groups and Perfect Codes for Generalizaed Deletions.
  • Hyungrok Jo*(U. of Tokyo), Yoshinori Yamasaki, Shingo Sugiyama: A general construction of LPS-type Ramanujan graphs.
  • Jon-Lark Kim*(Sogang U.): Recent results on binary LCD codes.
  • Justin Kekoa Kong*(U. of Hawaii): Descent Moment Distributions for Levenshtein Code Based Constant Weight Deletion Codes.
  • Kenichi Kuga*(Chiba U.): Some experiment of formalizing finite/projective geometry using Monte Carlo tree search.
  • Shigeaki Kuzuoka*(Wakayama U.): Properties and applications of the smooth Renyi entropy.
  • Shu Lin*(U. of California Davis): Juane Li, Partial Geometries on Finite Fields and Their Associated QC-LDPC Codes.
  • Allison Beemer, Ryan Coatney, Venkatesan Guruswami, Hiram H. Lopez*(Cleveland State U.), Fernando Pinero: Explicit optimal-locally repairable codes of distance 5.
  • Yuri I. Manin, Matilde Marcolli*(Caltech): Asymptotic bounds for spherical codes.
  • Gretchen Matthews* (Virginia Tech): Local recovery in the presence of errors.
  • Robert Morelos-Zaragoza*(San Jose State U.): Channel Coding in Wireless Networking Standards.
  • Kento Nakada*(Okayama U.): A certain code correcting two deletions with specified position.
  • J. B. Nation*(U. of Hawaii): Information-theoretic measures for gene clustering.
  • Ryo Nomura*(Senshu U.): Random Number Generation Problems with respect to f-Divergence.
  • Takayuki Nozaki*(Yamaguchi U.): Bounded Single Insertion/Deletion Correcting Code.
  • Yu Tsunoda*(Chiba U.), Yuichiro Fujiwara: Improved bounds through probabilistic methods for global quantum error correction.
  • Soowhan Yoon*(U. of Hawaii): Upper bounds for various error correcting codes.
  • June Zhang*(U. of Hawaii), Anders Host-Madsen: Impact of Topology on Epidemics and Cascading Failures.
Here is the schedule for talks in the special session:
Last Update: January 31, 2019.