[2402.09364] Performance-Complexity-Latency Trade-offs of Concatenated RS-BCH Codes
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:2402.09364 (cs)
[Submitted on 14 Feb 2024 (v1), last revised 19 Feb 2024 (this version, v2)]

Title:Performance-Complexity-Latency Trade-offs of Concatenated RS-BCH Codes

Authors:Alvin Y. Sukmadji, Frank R. Kschischang
View PDF
Abstract:Using a generating function approach, a computationally tractable expression is derived to predict the frame error rate arising at the output of the binary symmetric channel when a number of outer Reed--Solomon codes are concatenated with a number of inner Bose--Ray-Chaudhuri--Hocquenghem codes, thereby obviating the need for time-consuming Monte Carlo simulations. Measuring (a) code performance via the gap to the Shannon limit, (b) decoding complexity via an estimate of the number of operations per decoded bit, and (c) decoding latency by the overall frame length, a code search is performed to determine the Pareto frontier for performance-complexity-latency trade-offs.
Comments: Accepted for publication in the IEEE Transactions on Communications
Subjects: Information Theory (cs.IT)
Cite as: arXiv:2402.09364 [cs.IT]
  (or arXiv:2402.09364v2 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2402.09364
Journal reference: In IEEE Transactions on Communications, vol. 72, no. 7, pp. 3819-3841, July 2024
Related DOI: https://doi.org/10.1109/TCOMM.2024.3369731

Submission history

From: Alvin Sukmadji [view email]
[v1] Wed, 14 Feb 2024 18:11:42 UTC (587 KB)
[v2] Mon, 19 Feb 2024 04:06:06 UTC (589 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2024-02
Change to browse by:
cs
math
math.IT

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)