120 citations · 318 across the 11 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.IT2016★ 17 cited
Linear Network Coding over Rings, Part I: Scalar Codes and Commutative Alphabets
Joseph Connelly, Kenneth Zeger
Fixed-size commutative rings are quasi-ordered such that all scalar linearly solvable networks over any given ring are also scalar linearly solvable over any higher-ordered ring. A…
cs.IT2016★ 23 cited
Linear Network Coding over Rings, Part II: Vector Codes and Non-Commutative Alphabets
Joseph Connelly, Kenneth Zeger
We prove the following results regarding the linear solvability of networks over various alphabets. For any network, the following are equivalent: (i) vector linear solvability ove…
cs.IT2016★ 9 cited
A Class of Non-Linearly Solvable Networks
Joseph Connelly, Kenneth Zeger
For each integer , a network is constructed which is solvable over an alphabet of size but is not solvable over any smaller alphabets. If is composite, then the n…