Golay pseudocodewords

Speaker: Nigel Boston (UCD/CSI)

Time: 4:00PM

Date: Mon 23rd March 2009

Location: Mathematical Sciences Seminar Room

The minimum pseudodistance of a code is a better measure of performance than its minimum distance. Many people have tried and failed to show that the (tail-biting trellis of the) extended binary Golay code has minimum pseudodistance 8. I explain these terms and introduce a new technique using multivariate weight enumerators.

(This talk is part of the Algebra/Claude Shannon Institute series.)