TY - GEN
T1 - Further results on decoding linear block codes using a generalized Dijkstra's algorithm
AU - Han, Yunghsiang S.
AU - Hartmanq, Carlos R.P.
AU - Mehrotra, Kishan G.
PY - 1994
Y1 - 1994
N2 - An efficient maximum-likelihood soft-decision decoding algorithm for linear block codes using a generalized Dijkstra's algorithm was proposed by Han, Hartmann, and Chen (see IEEE Transactions on Information Theory, p.1514-1523, September 1993). We propose an even more efficient new version of this algorithm. An upper bound on the number of nodes searched by this new decoding algorithm is derived and a suboptimal decoding algorithm is also proposed.
AB - An efficient maximum-likelihood soft-decision decoding algorithm for linear block codes using a generalized Dijkstra's algorithm was proposed by Han, Hartmann, and Chen (see IEEE Transactions on Information Theory, p.1514-1523, September 1993). We propose an even more efficient new version of this algorithm. An upper bound on the number of nodes searched by this new decoding algorithm is derived and a suboptimal decoding algorithm is also proposed.
UR - http://www.scopus.com/inward/record.url?scp=33747128156&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33747128156&partnerID=8YFLogxK
U2 - 10.1109/ISIT.1994.394676
DO - 10.1109/ISIT.1994.394676
M3 - Conference contribution
AN - SCOPUS:33747128156
SN - 0780320158
SN - 9780780320154
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 342
BT - Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 1994 IEEE International Symposium on Information Theory, ISIT 1994
Y2 - 27 June 1994 through 1 July 1994
ER -