Characteristic-Dependent Linear Rank Inequalities with Applications to Network Coding
arXiv:1401.2507 · doi:10.1109/TIT.2015.2403361
Abstract
Two characteristic-dependent linear rank inequalities are given for eight variables. Specifically, the first inequality holds for all finite fields whose characteristic is not three and does not in general hold over characteristic three. The second inequality holds for all finite fields whose characteristic is three and does not in general hold over characteristics other than three. Applications of these inequalities to the computation of capacity upper bounds in network coding are demonstrated.
Cited by in corpus (5)
- How to Find New Characteristic-Dependent Linear Rank Inequalities using Binary Matrices as a Guide
- On the Dependence of Linear Coding Rates on the Characteristic of the Finite Field
- Characteristic-Dependent Linear Rank Inequalities via Complementary Vector Spaces
- How to Find New Characteristic-Dependent Linear Rank Inequalities using Secret Sharing
- Common Information, Matroid Representation, and Secret Sharing for Matroid Ports