Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

article · 2001

Recursive Decoding Procedures for Minimizing the Bit Error Probability for Block and Convolutional Codes

Vladimir B. Balakirsky, A. J. Han Vinck

Cited by 0Abstract and details only

Abstract

Recursive decoding procedures minimizing the bit error probability for block and convolutional codes and having complexities comparable to the complexity of maximum likelihood decoding are presented. The key idea of our approach to decoding problem is a representation of codewords as boundary points of the space consisting of rational-valued vectors whose components are probabilities. As a result, we arrive at the Viterbi-type algorithm, which constructs an optimal estimate of the transmitted information sequence, generalize considerations to the joint source-channel decoding, and present an algorithm for convolutional codes which does not require truncation of the code trellis.

Cite this paper

APA 7

Balakirsky, V. B., & Vinck, A. J. H. (2001). Recursive Decoding Procedures for Minimizing the Bit Error Probability for Block and Convolutional Codes.

MLA 9

Balakirsky, Vladimir B., and A. J. Han Vinck. “Recursive Decoding Procedures for Minimizing the Bit Error Probability for Block and Convolutional Codes.” 2001.

Chicago

Balakirsky, Vladimir B., and A. J. Han Vinck. 2001. “Recursive Decoding Procedures for Minimizing the Bit Error Probability for Block and Convolutional Codes.”

Harvard

Balakirsky, V.B. and Vinck, A.J.H. (2001) ‘Recursive Decoding Procedures for Minimizing the Bit Error Probability for Block and Convolutional Codes’.

BibTeX
@article{balakirsky2001recursive,
  title = {{Recursive Decoding Procedures for Minimizing the Bit Error Probability for Block and Convolutional Codes}},
  author = {Balakirsky, Vladimir B. and Vinck, A. J. Han},
  year = {2001}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers