LDPCk
LDPCk is a term that appears in some discussions to denote a class of low-density parity-check (LDPC) codes characterized by having k information bits, i.e., a code of dimension k and length n with rate R = k/n. In this usage, LDPCk codes are defined by a sparse parity-check matrix H of size (n−k) × n, which governs the parity constraints that the transmitted codeword must satisfy. The specific meaning of k, n, and the rate can vary by context, and LDPCk is not a universally standardized label. In practice, LDPC codes are more often described by their (n, k) parameters or by alternative design labels such as regular or irregular LDPC, or by protograph-based constructions.
Construction and design of LDPCk codes rely on sparse matrices where the average degree is small to
Performance and applications: LDPCk codes can approach channel capacity with appropriate design, particularly for long block