. . "Low Density Parity Check Coding"@en . "2014-05-15+02:00"^^ . "Low Density Parity Check Coding"@en . "Hejtm\u00E1nek, Jan" . . "RIV/68407700:21230/14:00219561" . . . "\u010Cesk\u00E9 vysok\u00E9 u\u010Den\u00ED technick\u00E9 v Praze" . "26664" . "5"^^ . . "[FE3D11B59B5C]" . "It is generally known that the code achieving Additive White Gaussian Noise (AWGN) channel capacity must have Gaussian distribution and infinite codeword dimension. In current communications such code is very frequently approximated by linear parity check code over finite field F^n_p having generating matrix that induces sparse parity check matrix with large dimension. This paper should summarize low density techniques used in channel code design. In the first part of this paper we focus on Low Density Parity Check (LDPC) codes properties over finite field and algorithms for generating matrices with desired properties. In the second part we describe Euclidean space extension known as Low Density Lattice Codes (LDLC), which can be efficiently used in dense networks by its natural structure.Recently, it was shown that lattice based codes can reach AWGN channel capacity, but under infinite codeword dimension constraint. This condition makes lattice codes practically unrealizable. However, by using nested scheme LDLC instead of general lattice, we can achieve rates being close to the channel capacity."@en . "It is generally known that the code achieving Additive White Gaussian Noise (AWGN) channel capacity must have Gaussian distribution and infinite codeword dimension. In current communications such code is very frequently approximated by linear parity check code over finite field F^n_p having generating matrix that induces sparse parity check matrix with large dimension. This paper should summarize low density techniques used in channel code design. In the first part of this paper we focus on Low Density Parity Check (LDPC) codes properties over finite field and algorithms for generating matrices with desired properties. In the second part we describe Euclidean space extension known as Low Density Lattice Codes (LDLC), which can be efficiently used in dense networks by its natural structure.Recently, it was shown that lattice based codes can reach AWGN channel capacity, but under infinite codeword dimension constraint. This condition makes lattice codes practically unrealizable. However, by using nested scheme LDLC instead of general lattice, we can achieve rates being close to the channel capacity." . "2"^^ . . . . "RIV/68407700:21230/14:00219561!RIV15-MSM-21230___" . "978-80-01-05499-4" . "Low Density Parity Check Coding" . . "1"^^ . "P(LD12062), S" . . . . "Praha" . . "Prague" . "LDPC; LDLC; capacity achieving codes; lattice codes"@en . . "21230" . . "Low Density Parity Check Coding" . . "POSTER 2014 - 18th International Student Conference on Electrical Engineering" . "R\u016F\u017Ei\u010Dka, Luk\u00E1\u0161" . .