19 citations · 20 across the 3 of their papers we have counts for
5 papers · 1 filter
A Combinatorial Family of Near Regular LDPC Codes
K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran +1
An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check codes achieving high girth is presented. The construction allows flexibi…
Efficient Convergent Maximum Likelihood Decoding on Tail-Biting Trellises
Priti Shankar, P. N. A. Kumar, K. Sasidharan +2
An algorithm for exact maximum likelihood(ML) decoding on tail-biting trellises is presented, which exhibits very good average case behavior. An approximate variant is proposed, wh…
Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds
K. Murali Krishnan, Priti Shankar
A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is prsented, that requires exactly two rounds on the trellis. This is an adaptation of an a…
On the Complexity of finding Stopping Distance in Tanner Graphs
K. Murali Krishnan, Priti Shankar
Two decision problems related to the computation of stopping sets in Tanner graphs are shown to be NP-complete. NP-hardness of the problem of computing the stopping distance of a T…
Approximate MAP Decoding on Tail-Biting Trellises
A. S. Madhu, Priti Shankar
We propose two approximate algorithms for MAP decoding on tail-biting trellises. The algorithms work on a subset of nodes of the tail-biting trellis, judiciously selected. We repor…