Characteristic-Dependent Linear Rank Inequalities With Applications to Network Coding

DOI10.1109/TIT.2015.2403361MaRDI QIDQ2978623zbMATH OpenFDO

Authors Randall Dougherty, Eric Freiling, Kenneth Zeger

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Information theory (general) (94A15) Source coding (94A29)

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 in

(4)

• On abelian and homomorphic secret sharing schemes
• Common information, matroid representation, and secret sharing for matroid ports
• The holographic entropy cone
• Introduction to secret-sharing

This page was built for publication: Characteristic-Dependent Linear Rank Inequalities With Applications to Network Coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2978623)