Powerful sets: a generalisation of binary matroids

zbMath1394.05013arXiv1705.07437MaRDI QIDQ1671667

Andrew Y. Z. Wang, Graham E. Farr

Publication date: 7 September 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.07437

zbMATH Keywords

matroidrank functionpowerful codepowerful set

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Linear codes (general theory) (94B05) Other types of codes (94B60) Combinatorial aspects of matroids and geometric lattices (05B35) Designs and configurations (05B99)

Related Items (1)

Binary functions, degeneracy, and alternating dimaps

Cites Work

• The Redei function of a relation
• On the classification of ideal secret sharing schemes
• Almost affine codes
• Some results on generalised Whitney functions
• Arrangements, channel assignments, and associated polynomials
• On the Combinatorics of Locally Repairable Codes via Matroid Theory
• A generalization of the Whitney rank generating function
• Unnamed Item
• Unnamed Item

This page was built for publication: Powerful sets: a generalisation of binary matroids