Abelian sharing, common informations, and linear rank inequalities
Dougherty et al. introduced the common information (CI) method as a method to produce non-Shannon inequalities satisfied by linear random variables, which are called linear rank inequalities. This method is based on the fact that linear random variables have CI. Dougerthy et al. asked whether this m...
Main Authors: | Mejia Carolina, Montoya Juan Andres |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2022-08-01
|
Series: | Journal of Mathematical Cryptology |
Subjects: | |
Online Access: | https://doi.org/10.1515/jmc-2022-0020 |
Similar Items
-
Information Inequalities via Submodularity and a Problem in Extremal Graph Theory
by: Igal Sason
Published: (2022-04-01) -
Secret sharing and duality
by: Csirmaz Laszlo
Published: (2020-11-01) -
Access structures determined by uniform polymatroids
by: Kawa Renata, et al.
Published: (2023-09-01) -
Analysis of the properties of matrix rank and the relationship between matrix rank and matrix operations
by: Ma Jiying
Published: (2021-11-01) -
A Linear Algebraic Threshold Essential Secret Image Sharing Scheme
by: Mohammad Ghebleh, et al.
Published: (2022-02-01)