Generalized Staircase Codes with Arbitrary Bit Degree
Information Theory
2024-02-23 v2 math.IT
Abstract
We introduce a natural generalization of staircase codes in which each bit is protected by arbitrarily many component codewords rather than two. This enables powerful energy-efficient FEC based on iterative decoding of Hamming components.
Keywords
Cite
@article{arxiv.2310.16165,
title = {Generalized Staircase Codes with Arbitrary Bit Degree},
author = {Mohannad Shehadeh and Frank R. Kschischang and Alvin Y. Sukmadji},
journal= {arXiv preprint arXiv:2310.16165},
year = {2024}
}
Comments
Submitted to 2024 Optical Fiber Communication Conference (OFC 2024)