On the public citation graph
Fundamentals of Index Coding
0 signed · 162 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1948.tb01338.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1002/j.1538-7305.1949.tb00928.xopenalex-snapshot
Communication Theory of Secrecy Systems*
inferredcites →https://doi.org/10.1002/jgt.3190090208openalex-snapshot
Longest paths and cycles in K 1,3 ‐free graphs
inferredcites →https://doi.org/10.1007/978-3-319-70293-3_10openalex-snapshot
Index Coding, Network Coding and Broadcast with Side-Information
inferredcites →https://doi.org/10.1007/978-3-642-58152-6openalex-snapshot
Linear Programming Duality: An Introduction to Oriented Matroids
inferredcites →https://doi.org/10.1007/bf01261326openalex-snapshot
Orthogonal representations over finite fields and the chromatic number of graphs
inferredcites →https://doi.org/10.1007/bf01504345openalex-snapshot
�ber die Verteilung der Wurzeln bei gewissen algebraischen Gleichungen mit ganzzahligen Koeffizienten
inferredcites →https://doi.org/10.1007/bf01581168openalex-snapshot
Approximating the independence number via theϑ-function
inferredcites →https://doi.org/10.1007/bfb0066438openalex-snapshot
Computing the Characteristic polynomial of a graph
inferredcites →https://doi.org/10.1016/0012-365x(72)90006-4openalex-snapshot
Normal hypergraphs and the perfect graph conjecture
inferredcites →https://doi.org/10.1016/0012-365x(86)90065-8openalex-snapshot
Coloring graphs with locally few colors
inferredcites →https://doi.org/10.1016/j.dam.2014.03.016openalex-snapshot
Graph classes and Ramsey numbers
inferredcites →https://doi.org/10.1016/j.jctb.2005.03.006openalex-snapshot
Local chromatic number and Sperner capacity
inferredcites →https://doi.org/10.1017/s0004972700007760openalex-snapshot
A new graph product and its spectrum
inferredcites →https://doi.org/10.1109/18.370142openalex-snapshot
Multilevel diversity coding with distortion
inferredcites →https://doi.org/10.1109/18.681320openalex-snapshot
On characterization of entropy function via information inequalities
inferredcites →https://doi.org/10.1109/18.761254openalex-snapshot
Distributed source coding for satellite communications
inferredcites →https://doi.org/10.1109/isit.2009.5206074openalex-snapshot
Gaussian broadcast channels with receiver message side information
inferredcites →https://doi.org/10.1109/isit.2014.6874839openalex-snapshot
Critical Graphs in Index Coding
inferredcites →https://doi.org/10.1109/isit.2017.8007042openalex-snapshot
Storage capacity as an information-theoretic analogue of vertex cover
inferredcites →https://doi.org/10.1109/jproc.2010.2094592openalex-snapshot
Theory of Secure Network Coding
inferredcites →https://doi.org/10.1109/jproc.2010.2095490openalex-snapshot
Network Coding and Matroid Theory
inferredcites →https://doi.org/10.1109/lcomm.2015.2388477openalex-snapshot
Index Coding With Coded Side-Information
inferredcites →https://doi.org/10.1109/lcomm.2015.2439268openalex-snapshot
Index Codes for the Gaussian Broadcast Channel Using Quadrature Amplitude Modulation
inferredcites →https://doi.org/10.1109/proc.1978.10848openalex-snapshot
On increasing the down-link capacity of a regenerative satellite repeater in point-to-point communications
inferredcites →https://doi.org/10.1109/tit.1956.1056798openalex-snapshot
The zero error capacity of a noisy channel
inferredcites →https://doi.org/10.1109/tit.1976.1055607openalex-snapshot
The zero-error side information problem and chromatic numbers (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1979.1055985openalex-snapshot
On the Shannon capacity of a graph
inferredcites →https://doi.org/10.1109/tit.1979.1056027openalex-snapshot
On Some Problems of Lovász Concerning the Shannon Capacity of a Graph
inferredcites →https://doi.org/10.1109/tit.1979.1056046openalex-snapshot
A coding theorem for the discrete memoryless broadcast channel
inferredcites →https://doi.org/10.1109/tit.2002.1003820openalex-snapshot
Communicating via a processing broadcast satellite
inferredcites →https://doi.org/10.1109/tit.2005.851744openalex-snapshot
Insufficiency of Linear Coding in Network Information Flow
inferredcites →https://doi.org/10.1109/tit.2006.874405openalex-snapshot
Unachievability of network coding capacity
inferredcites →https://doi.org/10.1109/tit.2006.874540openalex-snapshot
Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients
inferredcites →https://doi.org/10.1109/tit.2008.926344openalex-snapshot
Interference Alignment and Degrees of Freedom of the $K$-User Interference Channel
inferredcites →https://doi.org/10.1109/tit.2008.926460openalex-snapshot
Communication Over MIMO X Channels: Interference Alignment, Decomposition, and Performance Analysis
inferredcites →https://doi.org/10.1109/tit.2008.928963openalex-snapshot
Dualities Between Entropy Functions and Network Codes
inferredcites →https://doi.org/10.1109/tit.2009.2023702openalex-snapshot
Nonlinear Index Coding Outperforming the Linear Optimum
inferredcites →https://doi.org/10.1109/tit.2010.2048502openalex-snapshot
On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory
inferredcites →https://doi.org/10.1109/tit.2010.2090197openalex-snapshot
Secure Network Coding on a Wiretap Network
inferredcites →https://doi.org/10.1109/tit.2010.2090212openalex-snapshot
Universal Secure Network Coding via Rank-Metric Codes
inferredcites →https://doi.org/10.1109/tit.2010.2094910openalex-snapshot
On the Hardness of Approximating the Network Coding Capacity
inferredcites →https://doi.org/10.1109/tit.2010.2103753openalex-snapshot
Index Coding With Side Information
inferredcites →https://doi.org/10.1109/tit.2011.2155618openalex-snapshot
Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications
inferredcites →https://doi.org/10.1109/tit.2011.2173631openalex-snapshot
Secure Network Coding for Wiretap Networks of Type II
inferredcites →https://doi.org/10.1109/tit.2011.2173792openalex-snapshot
Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff
inferredcites →https://doi.org/10.1109/tit.2012.2188777openalex-snapshot
On the Security of Index Coding With Side Information
inferredcites →https://doi.org/10.1109/tit.2012.2227674openalex-snapshot
Error Correction for Index Coding With Side Information
inferredcites →https://doi.org/10.1109/tit.2013.2237752openalex-snapshot
Asymptotic Interference Alignment for Optimal Repair of MDS Codes in Distributed Storage
inferredcites →https://doi.org/10.1109/tit.2013.2241819openalex-snapshot
Repair Optimal Erasure Codes Through Hadamard Designs
inferredcites →https://doi.org/10.1109/tit.2013.2264472openalex-snapshot
Broadcasting With Side Information: Bounding and Approximating the Broadcast Rate
inferredcites →https://doi.org/10.1109/tit.2013.2279876openalex-snapshot
Dynamic Index Coding for Wireless Broadcast Networks
inferredcites →https://doi.org/10.1109/tit.2013.2285151openalex-snapshot
Topological Interference Management Through Index Coding
inferredcites →https://doi.org/10.1109/tit.2014.2306938openalex-snapshot
Fundamental Limits of Caching
inferredcites →https://doi.org/10.1109/tit.2014.2338865openalex-snapshot
Index Coding—An Interference Alignment Perspective
inferredcites →https://doi.org/10.1109/tit.2014.2354044openalex-snapshot
Duality Codes and the Integrality Gap Bound for Index Coding
inferredcites →https://doi.org/10.1109/tit.2015.2414926openalex-snapshot
An Equivalence Between Network Coding and Index Coding
inferredcites →https://doi.org/10.1109/tit.2015.2418289openalex-snapshot
Index Coding Capacity: How Far Can One Go With Only Shannon Inequalities?
inferredcites →https://doi.org/10.1109/tit.2015.2463277openalex-snapshot
Optimal Coding Schemes for the Three-Receiver AWGN Broadcast Channel With Receiver Message Side Information
inferredcites →https://doi.org/10.1109/tit.2015.2472521openalex-snapshot
Storage Capacity of Repairable Networks
inferredcites →https://doi.org/10.1109/tit.2015.2476792openalex-snapshot
Optimal Achievable Rates for Interference Networks With Random Codes
inferredcites →https://doi.org/10.1109/tit.2015.2504556openalex-snapshot
Fundamental Limits of Caching in Wireless D2D Networks
inferredcites →https://doi.org/10.1109/tit.2016.2529643openalex-snapshot
Cut-Set Bounds on Network Information Flow
inferredcites →https://doi.org/10.1109/tit.2016.2555950openalex-snapshot
The Single-Uniprior Index-Coding Problem: The Single-Sender Case and the Multi-Sender Extension
inferredcites →https://doi.org/10.1109/tit.2016.2608943openalex-snapshot
A Rate–Distortion Approach to Index Coding
inferredcites →https://doi.org/10.1109/tit.2017.2655034openalex-snapshot
Lattice Index Codes From Algebraic Number Fields
inferredcites →https://doi.org/10.1109/tit.2017.2662706openalex-snapshot
Interlinked Cycles for Index Coding: Generalizing Cycles and Cliques
inferredcites →https://doi.org/10.1109/tit.2017.2687933openalex-snapshot
Error Correction for Index Coding With Coded Side Information
inferredcites →https://doi.org/10.1109/tit.2017.2689028openalex-snapshot
The Capacity of Private Information Retrieval
inferredcites →https://doi.org/10.1109/tit.2017.2743688openalex-snapshot
Perfectly Secure Index Coding
inferredcites →https://doi.org/10.1109/tit.2017.2748562openalex-snapshot
Optimal Finite-Length and Asymptotic Index Codes for Five or Fewer Receivers
inferredcites →https://doi.org/10.1109/tit.2017.2752088openalex-snapshot
A Polynomial-Time Algorithm for Pliable Index Coding
inferredcites →https://doi.org/10.1109/tit.2017.2756663openalex-snapshot
Index Coding With Erroneous Side Information
inferredcites →https://doi.org/10.1109/tit.2017.2756959openalex-snapshot
A Fundamental Tradeoff Between Computation and Communication in Distributed Computing
inferredcites →https://doi.org/10.1109/tit.2018.2791994openalex-snapshot
The Capacity of Private Information Retrieval From Coded Databases
inferredcites →https://doi.org/10.1109/tit.2018.2795019openalex-snapshot
TDMA is Optimal for All-Unicast DoF Region of TIM if and only if Topology is Chordal Bipartite
inferredcites →https://doi.org/10.1109/tit.2018.2810384openalex-snapshot
The Minrank of Random Graphs
inferredcites →https://doi.org/10.1109/twc.2014.2330571openalex-snapshot
Data Dissemination With Side Information and Feedback
inferredcites →https://doi.org/10.1214/aoms/1177706106openalex-snapshot
The Capacity of a Class of Channels
inferredcites →https://doi.org/10.4007/annals.2006.164.51openalex-snapshot
The strong perfect graph theorem
inferredcites →https://doi.org/10.4153/cjm-1957-060-7openalex-snapshot
Graphs with Given Group and Given Graph-Theoretical Properties
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00493-024-00114-2openalex-snapshot
Storage Codes on Coset Graphs with Asymptotically Unit Rate
inferred← citeshttps://doi.org/10.1007/s10623-024-01481-zopenalex-snapshot
Storage codes and recoverable systems on lines and grids
inferred← citeshttps://doi.org/10.1109/allerton.2019.8919678openalex-snapshot
From Alignment to Acyclic Chains: Lexicographic Performance Bounds for Index Coding
inferred← citeshttps://doi.org/10.1109/allerton49937.2022.9929398openalex-snapshot
Hardness of Linear Index Coding on Perturbed Instances
inferred← citeshttps://doi.org/10.1109/allerton58177.2023.10313405openalex-snapshot
An Improved Greedy Cover Algorithm for Pliable Index Coding
inferred← citeshttps://doi.org/10.1109/icassp.2019.8682270openalex-snapshot
Pliable Data Shuffling for On-device Distributed Learning
inferred← citeshttps://doi.org/10.1109/icc45041.2023.10278932openalex-snapshot
The Generic Capacity of K User Symmetric Linear Computation Broadcast
inferred← citeshttps://doi.org/10.1109/isit.2018.8437663openalex-snapshot
Simplified Composite Coding for Index Coding
inferred← citeshttps://doi.org/10.1109/isit.2019.8849527openalex-snapshot
Optimal-Rate Characterisation for Pliable Index Coding using Absent Receivers
inferred← citeshttps://doi.org/10.1109/isit.2019.8849599openalex-snapshot
Generalized Alignment Chain: Improved Converse Results for Index Coding
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174436openalex-snapshot
Privacy-Utility Tradeoff in a Guessing Framework Inspired by Index Coding
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174439openalex-snapshot
Multi-Cast Channels with Hierarchical Flow
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9517778openalex-snapshot
Information Leakage in Zero-Error Source Coding: A Graph-Theoretic Perspective
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9517920openalex-snapshot
Update-based Maximum Column Distance Coding Scheme for Index Coding Problem
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9517928openalex-snapshot
Broadcast Rate Requires Nonlinear Coding in a Unicast Index Coding Instance of Size 36
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834479openalex-snapshot
Very Pliable Index Coding
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834541openalex-snapshot
Recoverable systems on lines and grids
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834733openalex-snapshot
Capacity of 3-user Linear Computation Broadcast over F q with 1D Demand and Side-Information
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834747openalex-snapshot
Information Leakage in Index Coding With Sensitive and Non-Sensitive Messages
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206829openalex-snapshot
Single-Server Pliable Private Information Retrieval With Side Information
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206846openalex-snapshot
Preferential Pliable Index Coding
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195361openalex-snapshot
Non-Linear Function Computation Broadcast
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195524openalex-snapshot
An Achievable Scheme for the K-User Linear Computation Broadcast Channel
inferred← citeshttps://doi.org/10.1109/itw.2018.8613351openalex-snapshot
Three-Layer Composite Coding for Index Coding
inferred← citeshttps://doi.org/10.1109/itw48936.2021.9611425openalex-snapshot
On Converse Results for Secure Index Coding
inferred← citeshttps://doi.org/10.1109/itw48936.2021.9611514openalex-snapshot
Information Leakage in Index Coding
inferred← citeshttps://doi.org/10.1109/iwcit.2019.8731629openalex-snapshot
Time-Sharing Improves Dynamic Index Coding Delay
inferred← citeshttps://doi.org/10.1109/jsait.2021.3053579openalex-snapshot
Single-Server Private Information Retrieval Schemes are Equivalent to Locally Recoverable Coding Schemes
inferred← citeshttps://doi.org/10.1109/jsait.2022.3232126openalex-snapshot
Information Leakage in Index Coding With Sensitive and Nonsensitive Messages
inferred← citeshttps://doi.org/10.1109/ojcoms.2022.3213789openalex-snapshot
On the Optimality of Linear Index Coding Over the Fields With Characteristic Three
inferred← citeshttps://doi.org/10.1109/tcomm.2020.2980817openalex-snapshot
Rate-Memory Trade-off for Multi-Access Coded Caching With Uncoded Placement
inferred← citeshttps://doi.org/10.1109/tcomm.2022.3168280openalex-snapshot
Sparse and Low-Rank Optimization for Pliable Index Coding via Alternating Projection
inferred← citeshttps://doi.org/10.1109/tcomm.2022.3207838openalex-snapshot
Design of Placement Delivery Arrays for Coded Caching With Small Subpacketizations and Flexible Memory Sizes
inferred← citeshttps://doi.org/10.1109/tcomm.2023.3280554openalex-snapshot
Strategies for Optimal Transmission and Delay Reduction in Dynamic Index Coding Problem
inferred← citeshttps://doi.org/10.1109/tit.2019.2947669openalex-snapshot
Tight Information Theoretic Converse Results for Some Pliable Index Coding Problems
inferred← citeshttps://doi.org/10.1109/tit.2019.2948845openalex-snapshot
Private Information Retrieval With Side Information
inferred← citeshttps://doi.org/10.1109/tit.2019.2961919openalex-snapshot
Generalized Lexicographic Products and the Index Coding Capacity
inferred← citeshttps://doi.org/10.1109/tit.2020.2967753openalex-snapshot
An Index Coding Approach to Caching With Uncoded Cache Placement
inferred← citeshttps://doi.org/10.1109/tit.2022.3186238openalex-snapshot
Topological Interference Management With Confidential Messages
inferred← citeshttps://doi.org/10.1109/tit.2022.3191309openalex-snapshot
High-Rate Storage Codes on Triangle-Free Graphs
inferred← citeshttps://doi.org/10.1109/tit.2022.3193723openalex-snapshot
Fundamental Limits of Combinatorial Multi-Access Caching
inferred← citeshttps://doi.org/10.1109/tit.2022.3195345openalex-snapshot
Unselfish Coded Caching Can Yield Unbounded Gains Over Selfish Caching
inferred← citeshttps://doi.org/10.1109/tit.2023.3347296openalex-snapshot
Hardness of Linear Index Coding on Perturbed Instances
inferred← citeshttps://doi.org/10.1109/tit.2024.3382257openalex-snapshot
On the Generic Capacity of K-User Symmetric Linear Computation Broadcast
inferred← citeshttps://doi.org/10.1109/tit.2024.3392685openalex-snapshot
The Capacity of 3 User Linear Computation Broadcast
inferred← citeshttps://doi.org/10.1109/tit.2024.3446000openalex-snapshot
Improved Approximation Algorithms for Index Coding
inferred← citeshttps://doi.org/10.1109/tnet.2020.3003907openalex-snapshot
Asynchronous Coded Caching With Uncoded Prefetching
inferred← citeshttps://doi.org/10.1360/ssm-2022-0074openalex-snapshot
Discrete configurations and combinatorial methods originated from distributed network
inferred← citeshttps://doi.org/10.1561/0100000103openalex-snapshot
Coded Computing: Mitigating Fundamental Bottlenecks in Large-Scale Distributed Computing and Machine Learning
inferred← citeshttps://doi.org/10.22533/at.ed.3173122324047openalex-snapshot
Index Coding from Reed-Solomon Codes
inferred← citeshttps://doi.org/10.22533/at.ed.820232606openalex-snapshot
Matemática: O sujeito e o conhecimento matemático 2
inferred← citeshttps://doi.org/10.22533/at.ed.8202326061openalex-snapshot
CARTEMÁTICA: UMA METODOLOGIA ATIVA PARA UMA APRENDIZAGEM CRIATIVA EM MATEMÁTICA
inferred← citeshttps://doi.org/10.22533/at.ed.8202326062openalex-snapshot
MATEMÁTICA FUNDAMENTAL: DIFICULDADES NO APRENDIZADO DAS QUATRO OPERAÇÕES COM NÚMERO NATURAL DOS ALUNOS DO 6º ANO NA ESCOLA ESTADUAL PADRE LUÍS RUAS
inferred← citeshttps://doi.org/10.22533/at.ed.8202326063openalex-snapshot
RELATO DE EXPERIÊNCIA: O USO DO SOFTWARE GEOGEBRA COMO RECURSO DIDÁTICO PARA O ENSINO DA FUNÇÃO EXPONENCIAL E LOGARÍTMICA
inferred← citeshttps://doi.org/10.22533/at.ed.8202326064openalex-snapshot
TECFORMAÇÃO: PENSAMENTO GEOMÉTRICO NO GEOGEBRA CLASSROOM
inferred← citeshttps://doi.org/10.22533/at.ed.8202326065openalex-snapshot
CODIFICAÇÃO DE ÍNDICE A PARTIR DE CÓDIGOS REED-SOLOMON
inferred← citeshttps://doi.org/10.22533/at.ed.8202326066openalex-snapshot
INMERSIONES Y PROPIEDADES DE LOS ESPACIOS DE SOBOLEV PERIÓDICO
inferred← citeshttps://doi.org/10.22533/at.ed.8202326067openalex-snapshot
LOS ESPACIOS l2(Z) CON PESO: PROPIEDADES Y SU CONEXIÓN CON LOS ESPACIOS DE SOBOLEV
inferred← citeshttps://doi.org/10.3390/e28090994openalex-snapshot
Shannon Capacity and Related Graph Invariants for Lexicographic Products
inferred← citeshttps://doi.org/10.48550/arxiv.2001.07296openalex-snapshot
Secure Index Coding with Security Constraints on Receivers
inferred← citeshttps://doi.org/10.48550/arxiv.2109.04807openalex-snapshot
Unselfish Coded Caching can Yield Unbounded Gains over Symmetrically Selfish Caching
inferred← citeshttps://doi.org/10.5540/03.2021.008.01.0383openalex-snapshot
Codificação de índice a partir de Códigos Reed-Solomon
inferred← citeshttps://doi.org/10.70675/1cc845acz686ez449ez98fazaf26f77dd599openalex-snapshot
Unearthing the Impact of Structure in Data and in Topology for Caching and Computing Networks
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.