Date of this Version
Thesis (M.S.)—University of Nebraska—Lincoln, 1972. Department of Computer Science.
In this paper we investigate the design of a binary block code to be transmitted through an arbitrary constant binary channel. By proper formulation of an objective function, the design becomes a computational problem of combinatorial nature. Several algorithms for searching the optimal value of this objective function are developed. Although only a local maxima is found, the amount of computational work has been greatly reduced. Moreover, from our experience, most of the time the obtained local maxima happens to be the global maxima.
Advisor: Y. R. Wang