2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS
|
2004年
关键词:
D O I:
暂无
中图分类号:
TP [自动化技术、计算机技术];
学科分类号:
0812 ;
摘要:
We show that the error probability for decoding interleaved Reed-Solomon Codes with the decoder found by Bleichenbacher et al. [1] is upper bounded by O(1/q), independently of n.