Shu Lin - Citegraph

Author Info

Name	Affiliation	Papers
SHU LIN	Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada	31
Collaborators	Citations	PageRank
35	575	133.22
Referers	Referees	References
1071	254	256

Search Limit

1001000

Publications (31 rows)

Collaborators (35 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Graph-theoretic construction of low-density parity-check codes	3	0.56	2003
Two decoding algorithms for tailbiting codes	38	3.19	2003
An efficient hybrid decoding algorithm for reed-solomon codes based on bit reliability	8	0.77	2003
An interactive concatenated turbo coding system	2	0.59	2002
Error performance analysis for reliability-based decoding algorithms	21	1.23	2002
Multilevel coded modulation for unequal error protection and multistage decoding .I. Symmetric constellations	8	0.60	2000
Iterative decoding of one-step majority logic deductible codes based on belief propagation	70	10.49	2000
MAP algorithms for decoding linear block codes based on sectionalized trellis diagrams	16	1.48	2000
On the weight distribution of terminated convolutional codes	10	1.08	1999
Quantization issues for soft-decision decoding of linear block codes	3	0.55	1999
A low-weight trellis-based iterative soft-decision decoding algorithm for binary linear block codes	5	0.59	1999
A trellis-based recursive maximum-likelihood decoding algorithm for binary linear block codes	13	1.29	1998
On block-coded modulation using unequal error protection codes over Rayleigh-fading channels	3	0.41	1998
On the equivalence between SOVA and max-log-MAP decodings	71	6.34	1998
Generalized coset decoding	2	0.49	1997
Soft-decision decoding of binary linear block codes based on an iterative search algorithm	20	2.52	1997
Product coded modulation	0	0.34	1997
Multidimensional trellis coded phase modulation using a multilevel concatenation approach .II. Codes for the AWGN and fading channels	2	0.39	1997
Coset codes viewed as terminated convolutional codes	3	0.43	1996
Some block- and trellis-coded modulations for the Rayleigh fading channel.	8	0.68	1996
Computationally efficient soft-decision decoding of linear block codes based on ordered statistics	31	2.21	1996
Effects of the catastrophic behavior of TCM schemes with partially overlapped signal constellations	1	0.38	1995
Low complexity, high performance and bandwidth efficient concatenated coded 8-PSK schemes for reliable data communications	1	0.37	1995
An upper bound on the effective error coefficient of two-stage decoding, and good two-level decompositions of some Reed-Muller codes	6	2.09	1994
Low-complexity and high-performance multilevel coded modulation for the AWGN and Rayleigh fading channels	2	0.41	1993
Coding for the binary symmetric broadcast channel with two receivers	10	2.66	1985
On the Undetected Error Probability for Shortened Hamming Codes	29	19.70	1985
On the Probability of Undetected Error for the Maximum Distance Separable Codes	42	8.25	1984
Coding for a multiple-access channel	46	13.19	1976
Some results on the minimum weight of primitive BCH codes (Corresp.)	14	2.18	1972
New generalizations of the Reed-Muller codes--I: Primitive codes	87	47.73	1968