Generalized Staircase Codes with Arbitrary Bit Degree

Generalized Staircase Codes with Arbitrary Bit Degree

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.

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Shehadeh, Mohannad, Kschischang, Frank R, Sukmadji, Alvin Y
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Information Theory
Mathematics - Information Theory
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
DOI:10.48550/arxiv.2310.16165