Kernels for storage capacity and dual index coding
Author:
- 25 April 2025
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 216
Abstract
No abstract availableAll Related Versions
Funding Information
- Israel Science Foundation (1218/20)
This publication has 14 references indexed in Scilit:
- Hardness of Linear Index Coding on Perturbed InstancesIEEE Transactions on Information Theory, 2023
- Linear Programming Approximations for Index CodingIEEE Transactions on Information Theory, 2019
- Storage Capacity as an Information-Theoretic Vertex Cover and the Index Coding RateIEEE Transactions on Information Theory, 2019
- Exact algorithms for maximum independent setInformation and Computation, 2017
- Storage Capacity of Repairable NetworksIEEE Transactions on Information Theory, 2015
- Optimal Index Codes With Near-Extreme RatesIEEE Transactions on Information Theory, 2013
- Index Coding With Side InformationIEEE Transactions on Information Theory, 2011
- On the Hardness of Approximating the Network Coding CapacityIEEE Transactions on Information Theory, 2011
- Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clientsIEEE Transactions on Information Theory, 2006
- Orthogonal representations over finite fields and the chromatic number of graphsCombinatorica, 1996