## The Eigenvalues and Relation Vectors of (1;b;p)-set Codes and Their Graphs |

### From inside the book

2 pages matching **lexicographically ordered** in this book

Where's the rest of this book?

Results 1-2 of 2

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Common terms and phrases

Ae-matrix algorithms associated frequency coefficients Aut(G automorphism group b-set bijection binary vectors bipartite graph bit nodes Chapter codewords columns comb complete graph compute constraint equations core Definition diagonal entries diagonalizable dimension edge in relation edge vector(space edge-to-edge adjacency matrix edges ek edges incident edges labelled eigen eigenvalues of HTH eigenvector Error-Correcting Codes example exists a permutation fact(n Figure graph is 1-transitive Group Theory H-matrix identity matrix incidence matrix Invariants ith associates Johnson association scheme l;b;p)-set code graph lexicographically ordered linear code linear programming problem maps minimum distance N.J.A. Sloane null matrix number of edges number of paths o o o p-set parity nodes possible 4-tuples Proof Qi(t reduced graph Reed-Muller Codes relation vectors set code 4-tuple set of relations temp Theorem thesis third components tion total graph associated transforms an edge tuples Vandermonde matrix vertex set