Christopher F. Freiling

Jason Teutsch

Inf. Comput., 2012

Achievable rate regions for network coding.

[BibT_eX]

[DOI]

Proceedings of the 2012 Information Theory and Applications Workshop, 2012

2011

Network Coding and Matroid Theory.

[BibT_eX]

[DOI]

Proc. IEEE, 2011

Non-Shannon Information Inequalities in Four Random Variables

[BibT_eX]

[DOI]

CoRR, 2011

2009

Linear rank inequalities on five or more variables

[BibT_eX]

[DOI]

CoRR, 2009

2008

Linear network codes and systems of polynomial equations.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007

Networks, Matroids, and Non-Shannon Information Inequalities.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

2006

Unachievability of network coding capacity.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Six New Non-Shannon Information Inequalities.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005

Insufficiency of linear coding in network information flow.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Network routing capacity.

[BibT_eX]

[DOI]

Jillian Cannons

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004

Linearity and solvability in multicast networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

2003

Almost all complete binary prefix codes have a self-synchronizing string.

[BibT_eX]

[DOI]

Douglas S. Jungreis

François Théberge