Coding theory has been both a source of intriguing problems in distance geometry and combinatorics and a beneficiary of the methods developed in these areas. Recent developments at the intersection of the three areas have highlighted several new, rapidly developing directions in each of them. The evolution of quantum coding has shed a new light on classical families of error- correcting codes such as Reed-Muller codes and their extensions, and has led to intriguing developments in the construction and applications of expander graphs and their higher-dimensional generalizations. There are interesting connections between finite point configurations, extremal combinatorics and questions arising from combinatorics of root systems, which again can be viewed in the language of codes. The workshop will bring together senior and junior participants who work in these areas, to share their ideas and current research, and advance the understanding of the interplay between distance geometry, combinatorics, and coding theory.