Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Strongly Connected Ramanujan Graphs for Highly Symmetric LDPC Codes
View through CrossRef
Abstract
A number of studies focus on Low-Density Parity-Check (LDPC) codes to ensure reliable data communications. This study proposes an algebraic algorithm to generate strongly connected Ramanujan graphs able to provide highly symmetric LDPC codes with minimized error floor. Several Ramanujan graphs are created using GAP system software to generate a rank-efficient parity-check matrix with fixed-rate LDPC codes. We find that Ramanujan LDPC codes achieve frame error rate and bit error rate on the order of \({10}^{-5}\) and \({10}^{-6}\), respectively. Furthermore, the codes outperform QC LDPC codes and those Ramanujan LDPC codes in literature.
Title: Strongly Connected Ramanujan Graphs for Highly Symmetric LDPC Codes
Description:
Abstract
A number of studies focus on Low-Density Parity-Check (LDPC) codes to ensure reliable data communications.
This study proposes an algebraic algorithm to generate strongly connected Ramanujan graphs able to provide highly symmetric LDPC codes with minimized error floor.
Several Ramanujan graphs are created using GAP system software to generate a rank-efficient parity-check matrix with fixed-rate LDPC codes.
We find that Ramanujan LDPC codes achieve frame error rate and bit error rate on the order of \({10}^{-5}\) and \({10}^{-6}\), respectively.
Furthermore, the codes outperform QC LDPC codes and those Ramanujan LDPC codes in literature.
Related Results
Generalised array low‐density parity‐check codes
Generalised array low‐density parity‐check codes
In this study, using Group Permutation Low‐Density Parity‐Check (GP‐LDPC) codes, the authors generalise the concept of array Low‐Density Parity‐Check (LDPC) codes from fields of pr...
Leveraging LDPC-Optimized Niederreiter Cryptosystems for Quantum-Resilient IoT Security Applications
Leveraging LDPC-Optimized Niederreiter Cryptosystems for Quantum-Resilient IoT Security Applications
The Niederreiter Cryptosystem is a well-established post-quantum cryptographic scheme knownfor its security, yet it suffers from large key sizes and computational inefficiencies, m...
Novel algorithm to construct QC-LDPC codes for high data rate applications
Novel algorithm to construct QC-LDPC codes for high data rate applications
A novel algorithm to construct highly sparse, quasi-cyclic low-density parity check codes with large girth and high code rates that can be employed in high data rate applications i...
Decoding of block and convolutional codes in rank metric
Decoding of block and convolutional codes in rank metric
Décodage des codes en bloc et des codes convolutifs en métrique rang
Les code en métrique rang attirent l’attention depuis quelques années en raison de leur applica...
Serially Concatenated Low-density Parity Check Codes as Compatible Pairs
Serially Concatenated Low-density Parity Check Codes as Compatible Pairs
Low-density parity checks (LDPC) codes are considered good performance error correction codes. However, decoder complexity increases with increasing code length. In this study, we ...
Extended low‐density parity‐check codes for feedback‐based cooperative diversity schemes
Extended low‐density parity‐check codes for feedback‐based cooperative diversity schemes
Cooperative diversity or user cooperation achieves the diversity gain without adding physical antennas to the users or mobile stations. The users work in a cooperative fashion by u...
Bipartite Unique Neighbour Expanders via Ramanujan Graphs
Bipartite Unique Neighbour Expanders via Ramanujan Graphs
We construct an infinite family of bounded-degree bipartite unique neighbour expander graphs with arbitrarily unbalanced sides. Although weaker than the lossless expanders construc...
A Convergence Analysis of LDPC Decoding Based on Eigenvalues
A Convergence Analysis of LDPC Decoding Based on Eigenvalues
Low-density parity check (LDPC) codes are very popular among error correction codes because of their high-performance capacity. Numerous investigations have been carried out to ana...