Ellipsoidal lists and maximum-likelihood decoding
- 作者Dumer, I.
- 卷第46卷
- 期第2期
- 印刷ISSN0018-9448
- 电子ISSN1557-9654
- 文件大小356.54KB
- 发表时间2000
- DOI10.1109/18.825836
- 页码649-656
Random coding techniques for nonrandom codesShulman, N.; Feder, M. · 1999
The uniform distribution as a universal priorShulman, N.; Feder, M. · 2004
[IEEE 2000 IEEE International Symposium on Information Theory - Sorrento, Italy (25-30 June 2000)] 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) - Static broadcastingShulman, N.; Feder, M. · 2000
[IEEE 1995 IEEE International Symposium on Information Theory - Whistler, BC, Canada (17-22 Sept. 1995)] Proceedings of 1995 IEEE International Symposium on Information Theory - A simple proof that time-invariant convolutional codes attain capacityShulman, N.; Feder, M. · 1995
[IEEE Eighteenth Convention of Electrical and Electronics Engineers in Israel - Tel Aviv, Israel (7-8 March 1995)] Eighteenth Convention of Electrical and Electronics Engineers in Israel - A technique to prove the channel coding theorem for a reduced class of codes and its applicationsShulman, N.; Feder, M. · 1995