Cite
Upper bound for uniquely decodable codes in a binary input N-user adder channel
MLA
Shraga I. Bross, and I.F. Blake. “Upper Bound for Uniquely Decodable Codes in a Binary Input N-User Adder Channel.” IEEE Transactions on Information Theory, vol. 44, Jan. 1998, pp. 334–40. EBSCOhost, https://doi.org/10.1109/18.651062.
APA
Shraga I. Bross, & I.F. Blake. (1998). Upper bound for uniquely decodable codes in a binary input N-user adder channel. IEEE Transactions on Information Theory, 44, 334–340. https://doi.org/10.1109/18.651062
Chicago
Shraga I. Bross, and I.F. Blake. 1998. “Upper Bound for Uniquely Decodable Codes in a Binary Input N-User Adder Channel.” IEEE Transactions on Information Theory 44 (January): 334–40. doi:10.1109/18.651062.