APA (7th ed.) Citation

Moulin, P. (2017). The Log-Volume of Optimal Codes for Memoryless Channels, Asymptotically Within a Few Nats. IEEE transactions on information theory, 63(4), 2278-2313. https://doi.org/10.1109/TIT.2016.2643681

Chicago Style (17th ed.) Citation

Moulin, Pierre. "The Log-Volume of Optimal Codes for Memoryless Channels, Asymptotically Within a Few Nats." IEEE Transactions on Information Theory 63, no. 4 (2017): 2278-2313. https://doi.org/10.1109/TIT.2016.2643681.

MLA (9th ed.) Citation

Moulin, Pierre. "The Log-Volume of Optimal Codes for Memoryless Channels, Asymptotically Within a Few Nats." IEEE Transactions on Information Theory, vol. 63, no. 4, 2017, pp. 2278-2313, https://doi.org/10.1109/TIT.2016.2643681.