DocumentCode
2618669
Title
Further results on decoding linear block codes using a generalized Dijkstra´s algorithm
Author
Han, Yunghsiang S. ; Hartmann, Carlos R P ; Mehrotra, Kishan G.
Author_Institution
Dept. of Electron. Eng., HuaFan Coll. of Humanities & Tech., Taipei, Taiwan
fYear
1994
fDate
27 Jun-1 Jul 1994
Firstpage
342
Abstract
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
Keywords
block codes; linear codes; maximum likelihood decoding; generalized Dijkstra´s algorithm; linear block codes; maximum-likelihood soft-decision decoding; nodes; suboptimal decoding algorithm; upper bound; Block codes; Communication systems; Educational institutions; Information science; Maximum likelihood decoding; Parity check codes; Personal digital assistants; Redundancy; Search problems; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location
Trondheim
Print_ISBN
0-7803-2015-8
Type
conf
DOI
10.1109/ISIT.1994.394676
Filename
394676
Link To Document