Results 1 to 10 of about 4,000 (161)
Generalized Index Coding Problem and Discrete Polymatroids [PDF]
The connections between index coding and matroid theory have been well studied in the recent past. Index coding solutions were first connected to multi linear representation of matroids.
Anoop Thomas, Balaji Sundar Rajan
doaj +2 more sources
Binary matroids and local complementation [PDF]
We introduce a binary matroid M(IAS(G)) associated with a looped simple graph G. M(IAS(G)) classifies G up to local equivalence, and determines the delta-matroid and isotropic system associated with G.
Traldi, Lorenzo
core +3 more sources
Powerful sets: a generalisation of binary matroids
A set $S\subseteq\{0,1\}^E$ of binary vectors, with positions indexed by $E$, is said to be a \textit{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.
Farr, Graham E., Wang, Andrew Y. Z.
core +3 more sources
On n-connected minors of the es-splitting binary matroids
The es-splitting operation on an n-connected binary matroid may not yield an n-connected matroid for (n ≥ 3). In this paper, we show that given an n-connected binary matroid M of rank r, the resulting es-splitting binary matroid has an n-connected minor ...
Prashant Pralhad Malavadkar +2 more
doaj +1 more source
Connections between Linear Complementary Dual Codes, Permanents and Geometry
Linear codes with complementary duals, or LCD codes, have recently been applied to side-channel and fault injection attack-resistant cryptographic countermeasures.
Adel N. Alahmadi +5 more
doaj +1 more source
On n-connected splitting matroids
In general, the splitting operation on a binary matroid M does not preserve the connectivity of M. In this paper, we provide sufficient conditions to preserve n-connectedness of a binary matroid under splitting operation.
Y.M. Borse, Ganesh Mundhe
doaj +2 more sources
Templates for Binary Matroids [PDF]
A binary frame template is a device for creating binary matroids from graphic or cographic matroids. Such matroids are said to conform or coconform to the template. We introduce a preorder on these templates and determine the nontrivial templates that are minimal with respect to this order.
Grace, Kevin, Van Zwam, Stefan H.M.
openaire +5 more sources
Cyclic flats of binary matroids
In this paper, first steps are taken towards characterising lattices of cyclic flats $\mathcal{Z}(M)$ that belong to matroids $M$ that can be represented over a prescribed finite field $\mathbb{F}_q$. Two natural maps from $\mathcal{Z}(M)$ to the lattice of cyclic flats of a minor of $M$ are given. Binary matroids are characterised via their lattice of
Grezet, Matthias +4 more
openaire +4 more sources
On the cogirth of binary matroids
8 ...
Crenshaw, Cameron, Oxley, James
openaire +2 more sources
The moduli space of matroids [PDF]
In the first part of the paper, we clarify the connections between several algebraic objects appearing in matroid theory: both partial fields and hyperfields are fuzzy rings, fuzzy rings are tracts, and these relations are compatible with the respective ...
Baker, Matthew, Lorscheid, Oliver
core +2 more sources

