Generalized Staircase Codes with Arbitrary Bit Degree
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917595137966080 |
|---|---|
| author | Shehadeh, Mohannad Kschischang, Frank R. Sukmadji, Alvin Y. |
| author_facet | Shehadeh, Mohannad Kschischang, Frank R. Sukmadji, Alvin Y. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_16165 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Generalized Staircase Codes with Arbitrary Bit Degree Shehadeh, Mohannad Kschischang, Frank R. Sukmadji, Alvin Y. Information Theory 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. |
| title | Generalized Staircase Codes with Arbitrary Bit Degree |
| topic | Information Theory |
| url | https://arxiv.org/abs/2310.16165 |