On the representability of integer polymatroids: Applications in linear code construction
It has been shown that there is a duality between the linear network coding solution and the entropic vectors induced by collection of subspaces in a vector space over a finite field (dubbed linearly constructed entropic vectors). The region of all linearly constructed vectors, coincides with the se...
Main Authors: | Salimi, Amir, Medard, Muriel, Cui, Shuguang |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2018
|
Online Access: | http://hdl.handle.net/1721.1/114894 https://orcid.org/0000-0003-4059-407X |
Similar Items
-
Generalized Index Coding Problem and Discrete Polymatroids
by: Anoop Thomas, et al.
Published: (2020-06-01) -
A Linear Network Code Construction for General Integer Connections Based on the Constraint Satisfaction Problem
by: Cui, Ying, et al.
Published: (2021) -
Secret sharing schemes and polymatroids
by: Yang, An
Published: (2014) -
Access structures determined by uniform polymatroids
by: Kawa Renata, et al.
Published: (2023-09-01) -
Study and characterization of some classes of polymatroidal ideals
by: Somayeh Bandari
Published: (2022-06-01)