LDPC

E358499

error-correcting code linear block code

LDPC (Low-Density Parity-Check) is a powerful class of linear error-correcting codes known for near-Shannon-limit performance and widespread use in modern high-throughput communication systems.

Try in SPARQL Jump to: Surface forms Statements Referenced by

All labels observed (3)

Label	Occurrences
LDPC canonical	2
Low-Density Parity-Check code	1
“Low-Density Parity-Check Codes”	1

Statements (50)

Predicate	Object
instanceOf	error-correcting code ⓘ linear block code ⓘ
basedOn	Tanner graph ⓘ
codeType	block code ⓘ
comparedWith	Turbo code ⓘ
designedUsing	EXIT chart analysis ⓘ density evolution ⓘ
fullName	LDPC self-linksurface differs ⓘ surface form: Low-Density Parity-Check code
hasMatrixType	parity-check matrix ⓘ
hasProperty	capacity-approaching ⓘ graph-based representation ⓘ iterative decoding ⓘ near-Shannon-limit performance ⓘ sparse parity-check matrix ⓘ
hasVariant	irregular LDPC code ⓘ protograph-based LDPC code ⓘ quasi-cyclic LDPC code ⓘ regular LDPC code ⓘ spatially coupled LDPC code ⓘ
introducedBy	Robert G. Gallager ⓘ
introducedInPublication	LDPC self-linksurface differs ⓘ surface form: “Low-Density Parity-Check Codes”
introducedInYear	1962 ⓘ
matrixDensity	low density of ones ⓘ
nodeType	check node ⓘ variable node ⓘ
outperforms	Turbo code at high block lengths ⓘ
rediscoveredInDecade	1990s ⓘ
representedAs	bipartite graph ⓘ
standardizedBy	3GPP ⓘ ETSI ⓘ Institute of Electrical and Electronics Engineers ⓘ surface form: IEEE
suitableFor	high-throughput hardware implementation ⓘ
supports	very long block lengths ⓘ
usedInApplication	cellular mobile networks ⓘ flash memory systems ⓘ optical communications ⓘ satellite communications ⓘ wireless local area networks ⓘ
usedInStandard	10GBASE-T ⓘ surface form: 10GBASE-T Ethernet 5G NR data channels ⓘ DOCSIS ⓘ surface form: DOCSIS 3.1 DVB-C2 ⓘ DVB-S2 ⓘ DVB-S2X ⓘ DVB-T2 ⓘ Wi‑Fi 6 ⓘ surface form: Wi-Fi 6 (IEEE 802.11ax) Wi‑Fi CERTIFIED 7 ⓘ surface form: Wi-Fi 7 (IEEE 802.11be)
usesDecodingAlgorithm	belief propagation ⓘ min-sum algorithm ⓘ sum-product algorithm ⓘ

How these facts were elicited

The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.

Instruction

You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10.

# Requirements
- If you don't know the subject at all, return an empty list.
- If the subject is not a named entity, return an empty list.
- Include at least one triple where predicate is "instanceOf".
- Do not get too wordy.
- Separate several objects into multiple triples with one object.

Input

Subject: LDPC
Description of subject: LDPC (Low-Density Parity-Check) is a powerful class of linear error-correcting codes known for near-Shannon-limit performance and widespread use in modern high-throughput communication systems.

Referenced by (4)

Full triples — surface form annotated when it differs from this entity's canonical label.

DVB-T2 → usesErrorCorrection → LDPC ⓘ

LDPC → fullName → LDPC self-linksurface differs ⓘ

this entity surface form: Low-Density Parity-Check code

LDPC → introducedInPublication → LDPC self-linksurface differs ⓘ

this entity surface form: “Low-Density Parity-Check Codes”

ETSI EN 302 307 → definesCoding → LDPC ⓘ