Results 151 to 160 of about 1,161 (180)
Some of the next articles are maybe not open access.
Results on punctured LDPC codes
Manufacturing Engineer, 2005In this paper we study some fundamental properties of punctured LDPC codes. We first prove that for any ensemble of LDPC codes, there exists a puncturing threshold p*. We then find lower bounds on the achievable rates of punctured codes over general MBIOS channels. These bounds are satisfied by using only one encoder and decoder for all rates.
Hossein Pishro-Nik, Faramarz Fekri
openaire +1 more source
On products of graphs for LDPC codes
Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674), 2004The notion of product block codes, whose generator matrix is the tensor product of the constituent generator matrices, is well established. Typically, they have good performance and a decoding algorithm with complexity on the order of the complexity of the decoding algorithms of the constituent codes.
Jun Xu 0004, Shu Lin 0001, Ian F. Blake
openaire +1 more source
On universal LDPC code ensembles
2010 IEEE International Symposium on Information Theory, 2010A universal design of low-density parity-check (LDPC) code ensembles which enables to operate reliably over various channels is of great theoretical and practical interest. This paper considers the universality of LDPC code ensembles over multitude memoryless binary-input output-symmetric (MBIOS) channels, addressing their universality under belief ...
Igal Sason, Boaz Shuval
openaire +1 more source
2001
An area of great interest for LDPC codes is the use of structured constructions rather than random constructions. These include graph theoretic approaches, such as the constructions by Margulis [Mar82] and Tanner [Tan00]. Ramanujan graphs are considered by Rosenthal and Vontobel [RV00] and finite geometries are used by Kou, Lin and Fos-sorier [KLF00 ...
openaire +1 more source
An area of great interest for LDPC codes is the use of structured constructions rather than random constructions. These include graph theoretic approaches, such as the constructions by Margulis [Mar82] and Tanner [Tan00]. Ramanujan graphs are considered by Rosenthal and Vontobel [RV00] and finite geometries are used by Kou, Lin and Fos-sorier [KLF00 ...
openaire +1 more source
Free-Ride Coding for Constructions of Coupled LDPC Codes
IEEE Transactions on Communications, 2023Xiao Ma, Qianfan Wang, Suihua Cai
exaly
2016 Information Theory and Applications Workshop (ITA), 2016
Juane Li +4 more
openaire +1 more source
Juane Li +4 more
openaire +1 more source
2023 IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB), 2023
Kun Zhu 0013, Hongwen Yang
openaire +1 more source
Kun Zhu 0013, Hongwen Yang
openaire +1 more source
Spatially Coupled LDPC Codes via Partial Superposition and Their Application to HARQ
IEEE Transactions on Vehicular Technology, 2021Xiao Ma, Shancheng Zhao, Li Chen
exaly
A Survey on Protograph LDPC Codes and Their Applications
IEEE Communications Surveys and Tutorials, 2015Yi Fang, Francis C M Lau, Guoan Bi
exaly