[IEEE 2001 IEEE International Symposium on Information Theory - Washington, DC, USA (24-29 June 2001)] Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) - Convex-programming bounds on the capacity of flat-fading channels
Lapidoth, A.; Moser, S.M.
- 作者Lapidoth, A.; Moser, S.M.
- 文件大小99.53KB
- 发表时间2001
- DOI10.1109/isit.2001.935915