|
|
A076892
|
|
Number of inequivalent ternary linear codes of length n. Also the number of nonisomorphic ternary matroids on an n-set.
|
|
0
|
|
|
2, 4, 8, 17, 36, 85, 216, 640, 2292, 9665, 80836, 1070709, 27652010, 1345914266, 115596164732
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
REFERENCES
|
M. Wild, Enumeration of binary and ternary matroids and other applications of the Brylawski-Lucas theorem, Technische Hochschule Darmstadt, Preprint 1693, 1994
|
|
LINKS
|
|
|
EXAMPLE
|
The two linear ternary codes of length 3, {(0,0,0), (1,-1,0), (-1,1,0) } and {(0,0,0), (-1,0,-1), (1,0,1) } are equivalent because the latter arises from the former by changing the sign of the first component of every codeword and switching the second with the third component.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
Marcel Wild (mwild(AT)sun.ac.za), Nov 26 2002
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|