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...
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...
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...
The Role of Eigenvalues of Parity Check Matrix in Low-Density Parity Check Codes
The Role of Eigenvalues of Parity Check Matrix in Low-Density Parity Check Codes
The new developments in coding theory research have revolutionized the application of coding to practical systems. Low-Density Parity Check (LDPC) codes form a class of Shannon lim...
Quantum XYZ Product Codes
Quantum XYZ Product Codes
We study a three-fold variant of the hypergraph product code construction, differing from the standard homological product of three classical codes. When instantiated with 3 classi...
Huffrith Algorithm with Quasi Cyclic Low Density Parity Check in NOMA Systems
Huffrith Algorithm with Quasi Cyclic Low Density Parity Check in NOMA Systems
In this paper, the high-rate Quasi-Cyclic Low-Density Parity -Check (QC-LDPC) as an error correction code is contributed for Non-orthogonal Multiple Access (NOMA) systems with high...
Coded Cooperation for Multiway Relaying in Wireless Sensor Networks
Coded Cooperation for Multiway Relaying in Wireless Sensor Networks
Wireless sensor networks have been considered as an enabling technology for constructing smart cities. One important feature of wireless sensor networks is that the sensor nodes co...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...