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
Jayant Apte and J. M. Walsh, Constrained Linear Representability of Polymatroids and Algorithms for Computing Achievability Proofs in Network Coding, arXiv preprint arXiv:1605.04598 [cs.IT], 2016-2017.
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
a(9) corrected by Gordon Royle, Oct 27 2007
STATUS
approved