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
Veröffentlicht in:arXiv.org 2024-02
Hauptverfasser: Shehadeh, Mohannad, Kschischang, Frank R, Sukmadji, Alvin Y
Format: Artikel
Sprache:eng
Schlagworte:
Decoding
Staircases
Online-Zugang:Volltext
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.
ISSN:2331-8422