pith. sign in

arxiv: 1011.1044 · v1 · pith:ML4UBTFCnew · submitted 2010-11-04 · 🧮 math.CO

Generalized Hamming schemes

Chris Godsil This is my paper
classification 🧮 math.CO
keywords hammingschemesassociationclassderiveeigenvaluesfunctionsgeneralized
0
0 comments X
read the original abstract

We introduce a class of association schemes that generalizes the Hamming scheme. We derive generating functions for their eigenvalues, and use these to obtain a version of MacWilliams theorem.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Imprimitive association schemes and elimination theory

    math.CO 2026-03 unverdicted novelty 7.0

    A commutative association scheme is imprimitive if and only if it admits a multivariate P- or Q-polynomial structure with respect to an elimination-type monomial order.