On Some Probabilistic Decoding Algorithms,
Abstract
Several methods for the formulation of the probabilistic decoding problem for binary group codes in a mathematical programming form are discussed. In particular, the formulation as a pseudo-Boolean programming and a zero-one integer programming are considered in detail. The discussion is concerned primarily with the independent errors case. A simple case of first-order Markov error model is also investigated, and the resulting algorithm is derived. The case of dependent errors may result in faster decoding algorithm. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 01, 1970
- Accession Number
- AD0714077
Entities
People
- A. H. Haddad
Organizations
- University of Illinois Urbana–Champaign