Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Eric Freiling

dblp:140/7270 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2015
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 70% Information theory · 30%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information theory › channel capacity › capacity bounds
capacity upper bound		 0.212015
Characteristic-Dependent Linear Rank Inequalities With Applications to Network Coding · IEEE Trans. Inf. Theory 2015
Coding theory
network coding		 0.212015
Characteristic-Dependent Linear Rank Inequalities With Applications to Network Coding · IEEE Trans. Inf. Theory 2015
Coding theory › network coding
network coding capacity		 0.212015
Characteristic-Dependent Linear Rank Inequalities With Applications to Network Coding · IEEE Trans. Inf. Theory 2015
Coding theory
finite fields		 0.112015
Characteristic-Dependent Linear Rank Inequalities With Applications to Network Coding · IEEE Trans. Inf. Theory 2015

Methods — techniques the papers use, named apart from their topics

linear rank inequalities · 0.2capacity bounds · 0.2
YearPublicationVenuePosition
2015 Characteristic-Dependent Linear Rank Inequalities With Applications to Network Coding
abstract
Two characteristic-dependent linear rank inequalities are given for eight variables. In particular, the first inequality holds for all finite fields whose characteristic is not three and does not in general hold over characteristic three. The second inequality holds for all finite fields whose characteristic is three and does not in general hold over characteristics other than three. Applications of these inequalities to the computation of capacity upper bounds in network coding are demonstrated.
Randall Dougherty, Eric Freiling, Kenneth Zeger
 IEEE Trans. Inf. Theory2
2014 Characteristic-dependent linear rank inequalities and network coding applications
abstract
Two characteristic-dependent linear rank inequalities are given for eight variables. Specifically, the first inequality holds for all finite fields whose characteristic is not three and does not in general hold over characteristic three. The second inequality holds for all finite fields whose characteristic is three and does not in general hold over characteristics other than three. Applications of these inequalities to the computation of capacity upper bounds in network coding are demonstrated.
Randall Dougherty, Eric Freiling, Kenneth Zeger
 ISIT2