DIMACS TR: 99-54

On Polynomial Invariants of Codes, Matroids and Finite Interaction Models

Author: Alexander Barg


A linear code can be thought of as a vector matroid represented by the columns of code's generator matrix; a well-known result in this context is Greene's theorem on a connection of the weight polynomial of the code and the Tutte polynomial of the matroid. We examine this connection from the coding-theoretic viewpoint, building upon the rank polynomial of the code. This enables us

Paper Available at: ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/1999/99-54.ps.gz
DIMACS Home Page