An Efficient Multiple-Access Method for the Binary Adder Channel. - Israel Bar-David; Eli Plotnik; Raphael Rom (INFOCOM, 1989)

Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm. - Eli Plotnik; Marcelo J. Weinberger; Jacob Ziv (IEEE Trans. Inf. Theory, 1992)

Forward collision resolution - A technique for random multiple-access to the adder channel. - Israel Bar-David; Eli Plotnik; Raphael Rom (IEEE Trans. Inf. Theory, 1993)

Code constructions for asynchronous random multiple-access to the adder channel. - Eli Plotnik (IEEE Trans. Inf. Theory, 1993)

Limitations of the capacity of the M-user binary adder channel due to physical considerations. - Israel Bar-David; Eli Plotnik; Raphael Rom (IEEE Trans. Inf. Theory, 1994)