
TL;DR
This paper introduces a super-product BCH code capable of near-Shannon limit performance with low decoding complexity, providing a simple method to evaluate performance bounds at very low BER for advanced coding schemes in high-speed networking.
Contribution
It proposes a novel super-product BCH code and a straightforward evaluation approach for performance bounds at extremely low BER in high-speed optical networking.
Findings
Super-product BCH code achieves near-Shannon limit performance.
New evaluation method for performance bounds at very low BER.
Applicable to 40/100 Gbps networking scenarios.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
