Further results on decoding linear block codes using a generalized Dijkstra's algorithm

Yunghsiang S. Han, Carlos R.P. Hartmanq, Kishan G. Mehrotra

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationProceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994
Number of pages1
DOIs
StatePublished - Dec 1 1994
Event1994 IEEE International Symposium on Information Theory, ISIT 1994 - Trondheim, Norway
Duration: Jun 27 1994Jul 1 1994

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Other

Other1994 IEEE International Symposium on Information Theory, ISIT 1994
CountryNorway
CityTrondheim
Period6/27/947/1/94

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Further results on decoding linear block codes using a generalized Dijkstra's algorithm'. Together they form a unique fingerprint.

  • Cite this

    Han, Y. S., Hartmanq, C. R. P., & Mehrotra, K. G. (1994). Further results on decoding linear block codes using a generalized Dijkstra's algorithm. In Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994 [394676] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.1994.394676