Index Coding

This page lists all index coding problems up to n=5 messages and their optimal broadcast rates.

• n=1 (1 problem)

• n=2 (3 problems)

• n=3 (16 problems)

• n=4 (218 problems)

• n=5 (9608 problems)

Here IC[n,k] denotes the k-th index coding problem with n messages, where k is the index of the corresponding side information graph in all nonisomorphic directed graphs with n vertices generated by the Mathematica function “ListGraphs[n, Directed]”.