Mobius inversion in coding theory
refreshments at 3:45pm
We briefly recall the basics about Mobius inversion on
partially ordered sets. Using this, we introduce an inversion principle
for real-valued functions on finite modules. As an application, we
present a combinatorial proof for MacWilliams' equivalence theorem for
linear codes over finite Frobenius rings.
Speaker's Contact Info: schmidt(at-sign)math.mit.edu
Return to seminar home page
Page loaded on September 15, 1999 at 01:14 PM.
Copyright © 1998-99, Sara C. Billey.
All rights reserved.