Entropic matroids and their representation

09/26/2019
by   Emmanuel Abbe, et al.
0

This paper investigates entropic matroids, that is, matroids whose rank function is given as the Shannon entropy of random variables. In particular, we consider p-entropic matroids, for which the random variables each have support of cardinality p. We draw connections between such entropic matroids and secret-sharing matroids and show that entropic matroids are linear matroids when p = 2,3 but not when p = 9. Our results leave open the possibility for p-entropic matroids to be linear whenever p is prime, with particular cases proved here. Applications of entropic matroids to coding theory and cryptography are also discussed.

READ FULL TEXT
research
10/18/2010

The Common Information of N Dependent Random Variables

This paper generalizes Wyner's definition of common information of a pai...
research
09/17/2022

Some stochastic comparison results for frailty and resilience models

Frailty and resilience models provide a way to introduce random effects ...
research
04/20/2022

An entropy functional bounded from above by one

Shannon entropy is widely used for quantifying uncertainty in discrete r...
research
12/02/2021

Interval extropy and weighted interval extropy

Recently, Extropy was introduced by Lad, Sanfilippo and Agrò as a comple...
research
01/09/2022

Arithmetic Network Coding for Secret Sum Computation

We consider a network coding problem where the destination wants to reco...
research
06/07/2022

On entropic and almost multilinear representability of matroids

This article is concerned with two notions of generalized matroid repres...
research
12/12/2019

An Integral Representation of the Logarithmic Function with Applications in Information Theory

We explore a well-known integral representation of the logarithmic funct...

Please sign up or login with your details

Forgot password? Click here to reset