Binary linear codes via 4D discrete Ihara-Selberg function

Series
Graph Theory Seminar
Time
Tuesday, January 20, 2015 - 12:05pm for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Martin Loebl – Charles University
Organizer
Robin Thomas
We express weight enumerator of each binary linear code as a product. An analogous result was obtain by R. Feynman in the beginning of 60's for the speacial case of the cycle space of the planar graphs.