面向40/100 Gbps网络的Super-FEC码
Super-FEC Codes for 40/100 Gbps Networking
AI总结：
本文提出评估二进制伪乘积码与真乘积码极低BER性能界的简单方法，还提出可在低译码复杂度下实现近香农极限性能的超级乘积BCH码，相关成果已被IEEE Communications Letters接收。
摘要：
本文提出了一种简单方法，用于评估二进制伪乘积码和真乘积码在极低误码率（BER）范围内的性能界。此外，本文介绍了一种超级乘积BCH码，该码能以极低的译码复杂度实现接近香农极限的性能。该工作已被《IEEE Communications Letters》接收，将于未来发表。版权可能会在不另行通知的情况下转移，届时本版本可能不再可访问。
英文摘要：
This paper presents a simple approach to evaluate the performance bound at very low bit-error-rate (BER) range for binary pseudo-product codes and true-product codes. Moreover it introduces a super-product BCH code that can achieve near-Shannon limit performance with very low decoding complexity. This work has been accepted by IEEE Communications Letters for future publication. Copyright may be transferred without notice, after which this version may no longer be accessible.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
