Powerful Sets: a Generalisation of Binary Matroids

Electronic Journal Of Combinatorics

Graham E. Farr¹ 

关键词: Powerful set;    Powerful code;    Matroid;    Rank function;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

A set $S\subseteq\{0,1\}^E$ of binary vectors, with positions indexed by $E$, is said to be a powerful code if, for all $X\subseteq E$, the number of vectors in $S$ that are zero in the positions indexed by $X$ is a power of 2.  By treating binary vectors

【 授权许可】

Others