75 citations · 75 across the 2 of their papers we have counts for
5 papers · 1 filter
Competitive Advantage of Huffman and Shannon-Fano Codes
Spencer Congero, Kenneth Zeger
For any finite discrete source, the competitive advantage of prefix code over prefix code is the probability produces a shorter codeword than , minus the pro…
A Characterization of Optimal Prefix Codes
Spencer Congero, Kenneth Zeger
A property of prefix codes called strong monotonicity is introduced, and it is proven that for a given source, a prefix code is optimal if and only if it is complete and strongly m…
Capacity and Achievable Rate Regions for Linear Network Coding over Ring Alphabets
Joseph Connelly, Kenneth Zeger
The rate of a network code is the ratio of the block size of the network's messages to that of its edge codewords. We compare the linear capacities and achievable rate regions of n…
Non-Shannon Information Inequalities in Four Random Variables
Randall Dougherty, Chris Freiling, Kenneth Zeger
Any unconstrained information inequality in three or fewer random variables can be written as a linear combination of instances of Shannon's inequality I(A;B|C) >= 0 . Such inequal…
Linear Codes, Target Function Classes, and Network Computing Capacity
Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani +1
We study the use of linear codes for network computing in single-receiver networks with various classes of target functions of the source messages. Such classes include reducible,…