Abstract. In this contribution the problem of channel decoding is considered from the viewpoint of optimization theory. The decoding problem is at first denoted as integer optimization problem. To solve this problem, well-known methods from optimization theory are suitable. Two examples are presented: First, an Omura-type algorithm from [13] can be derived from the Simplex algorithm. Second, the decoding problem is reformulated such that it can be solved by a Branch-and-Bound algorithm. By simulation results, questions concerning bit error rate and complexity will be discussed.
We propose a class of codes correcting multiple bursts of errors and erasures in the columns of a two-dimensional array. The erasure-correcting codes possess the minimum possible redundancy. The redundancy of the error-correcting codes is close to minimum.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.