Results 11 to 20 of about 26,841 (236)
Connectivity constrains quantum codes [PDF]
Quantum low-density parity-check (LDPC) codes are an important class of quantum error correcting codes. In such codes, each qubit only affects a constant number of syndrome bits, and each syndrome bit only relies on some constant number of qubits ...
Nouédyn Baspin, Anirudh Krishna
doaj +1 more source
Asymmetric quantum LDPC codes [PDF]
5 pages, 1 figure, 1 table, to appear in the Proceedings of the 2008 IEEE International Symposium on Information ...
Sarvepalli, Pradeep Kiran +2 more
openaire +2 more sources
Optimizing quasi-cyclic spatially coupled LDPC codes by eliminating harmful objects
It is well known that some harmful objects in the Tanner graph of low-density parity-check (LDPC) codes have a negative impact on their error correction performance under iterative message-passing decoding.
Massimo Battaglioni +4 more
doaj +1 more source
Randomly Punctured LDPC Codes [PDF]
In this paper, we present a random puncturing analysis of low-density parity-check (LDPC) code ensembles. We derive a simple analytic expression for the iterative belief propagation (BP) decoding threshold of a randomly punctured LDPC code ensemble on the binary erasure channel (BEC) and show that, with respect to the BP threshold, the strength and ...
Mitchell, David G. M. +3 more
openaire +3 more sources
Στα ψηφιακά συστήματα, η πληροφορία κωδικοποιείται σε ακολουθίες από 0και 1, που αντιστοιχούν στις δύο δυνατές καταστάσεις των τρανζίστορ, on - off, τα οποία λειτουργούν ως διακόπτες. Το πλεονέκτημα αυτό έχει επιφέρει σημαντικέςαλλαγές στον τρόπο επεξεργασίας της πληροφορίας.
openaire +1 more source
A Time Sharing Hybrid Probabilistic Shaping Scheme for Nonbinary LDPC Codes
A time sharing (TS) hybrid probabilistic shaping (HPS) scheme for nonbinary (NB) LDPC codes is proposed. For the conventional probabilistic shaping (CPS) scheme, the demodulator uses bit-metric decoding (BMD) for binary LDPC codes and NB LDPC codes ...
Zhanji Wu, Weimin Kang
doaj +1 more source
Effective identification of dominant fully absorbing sets for Raptor-like LDPC codes
The error-rate floor of low-density parity-check (LDPC) codes is attributed to the trapping sets of their Tanner graphs. Among them, fully absorbing sets dominantly affect the error-rate performance, especially for short blocklengths.
Woncheol Cho +3 more
doaj +1 more source
Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights [PDF]
We present a tree-based construction of LDPC codes that have minimum pseudocodeword weight equal to or almost equal to the minimum distance, and perform well with iterative decoding.
Kelley, Christine +2 more
core +4 more sources
High performance short-block binary regular LDPC codes
LDPC code shows a good performance with long-block codes. However, certain channels are constrained to use short-block codes due to latency. Therefore, concatenated LDPC codes with iterative decoding is a good choice to get a good performance ...
Latifa Mostari, Abdelmalik Taleb-Ahmed
doaj +1 more source
Full-Length Row-Multiplier QC-LDPC Codes With Girth Eight and Short Circulant Sizes
As a special case of a quasi-cyclic (QC) low-density parity-check (LDPC) code, a full-length row-multiplier (FLRM) QC-LDPC code is described by a compact exponent matrix based on two sequences of integers.
Juhua Wang +3 more
doaj +1 more source

