Results 171 to 180 of about 45,321 (190)

Absorbing sets in the Tanner graphs of LDPC codes derived from geodetic graphs

2016
The error floor performance of an LDPC code is related with the existence of certain substructures of the corresponding Tanner graph. Substructures that are called trapping sets, and especially absorbing sets as their subclass, determine the iterative decoding performance and are important contributors to the error floor for AWGN channel.
Šimac, Marina, Rukavina, Sanja, Crnković, Dean   +2 more
openaire   +1 more source

Unsourced Multiple Access Based on Sparse Tanner Graph—Efficient Decoding, Analysis, and Optimization

IEEE Journal on Selected Areas in Communications, 2022
Xiaodong Wang, Xiaodong Wang
exaly  

Tanner-Graph-Based Massive Multiple Access—Transmission and Decoding Schemes

IEEE Transactions on Wireless Communications, 2023
Jiaai Liu, Xiaodong Wang 0001
openaire   +1 more source

Detecting Cycles of Length 10 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis

Problems of Information Transmission, 2021
exaly  

Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds

IEEE Transactions on Information Theory, 2012
Roxana Smarandache
exaly  

An extended Tanner graph approach to decoding LDPC codes over decode-and-forward relay channels

, 2016
Bin Qian, Wai Ho Mow
openalex   +1 more source

Iterative soft decoding of binary linear codes using a generalized Tanner graph

2011
Eirik Rosnes
exaly  

Low density parity check lattices based on construction 𝐷′ and cycle-free Tanner graphs

, 2005
Mohammad Sadeghi, Daniel Panario
openalex   +1 more source

Pseudocodeword-free criterion for codes with cycle-free Tanner graph

Designs, Codes, and Cryptography, 2018
Wittawat Kositwattanarerk
exaly  

Exploiting cyclic prefix redundancy in OFDM to improve performance of Tanner: graph based decoding

, 2011
Tomáš Páleník, Peter Farkaš
openalex   +1 more source