Even poset and a parity result for binary linear code
From MaRDI portal
Publication:855546
DOI10.1016/j.laa.2006.02.028zbMath1106.05056OpenAlexW2138795851MaRDI QIDQ855546
Publication date: 7 December 2006
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2006.02.028
Partial orders, general (06A06) Eulerian and Hamiltonian graphs (05C45) Vector spaces, linear dependence, rank, lineability (15A03) Communication theory (94A05)
Related Items
On n-connected minors of the es-splitting binary matroids, Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?, Parity and disparity subgraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recharacterizing Eulerian: Intimations of new duality
- Elementary proofs of (relatively) recent characterizations of Eulerian graphs
- The Euler circuit theorem for binary matroids
- Properties of a Euler graph
- Counting maximal cycles in binary matroids
- Splitting in a binary matroid
- On the non-minimal codewords in binary Reed-Muller codes
- Linear cellular automata and the garden-of-eden
- A proof of McKee's Eulerian-bipartite characterization
- Determination of the bases of a splitting matroid
- A characterization of binary Eulerian matroids
- Combinatorial Optimization
- Minimal vectors in linear codes
- Euler and bipartite matroids
- New characterizations of Eulerian and bipartite binary matroids
