Shraga I. Bross, Ian F. Blake Upper Bound for Uniquely Decodable Codes in a Binary Input N-User Adder Channel. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:334-340 [Journal]
Shraga I. Bross, Amos Lapidoth An improved achievable region for the discrete memoryless two-user multiple-access channel with noiseless feedback. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2005, v:51, n:3, pp:811-833 [Journal]
Shraga I. Bross, Shlomo Shamai Capacity and decoding rules for the Poisson arbitrarily varying chann. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2003, v:49, n:11, pp:3076-3093 [Journal]
E. Hof, Shraga I. Bross On the Deterministic-Code Capacity of the Two-User Discrete Memoryless Arbitrarily Varying General Broadcast Channel With Degraded Message Sets. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:5023-5044 [Journal]
Shraga I. Bross A Converse Result for the Discrete Memoryless Relay Channel With Relay-Transmitter Feedback. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:8, pp:3789-3792 [Journal]
G. Nakibly, Shraga I. Bross On the Reliability Exponents of Two Discrete-Time Timing Channel Models. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:9, pp:4320-4335 [Journal]
Y. Gabbai, Shraga I. Bross Achievable Rates for the Discrete Memoryless Relay Channel With Partial Feedback Configurations. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:4989-5007 [Journal]