An investigation of algorithms for systematically choosing channel codes with large hamming distances
- Bangkok : Asian Institute of Technology, 1994
- 39 leaves
- Research studies project report ; no. TC-94-09 .
- Asian Institute of Technology. Research studies project report ; no. TC-94-09 .
A research submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Engineering and Technology
Research Studies Project Report (M.Eng.) - Asian Institute of Technology, 1994
Soning algorithms are used to find good sets of code word with large Hamming distances. Two Algorithms: the Discarding Saning (DS) - Algorithm and the Enhancing Saning (ES) - Algorithm have been implemented. Investigation to select good channel codes are made by applying these two Algorithms. Existing best known linear codes are used to compare these good sets of code word. Plotkin Bound is checked on the number of code words for fixed values of code length and minimum distance. It has been noticed that the ES - Algorithm can find always at least as many code words as there are in existing best known linear codes and in many cases the Algorithms find more than that for fixed values of code length and minimum distance. The results always meet the Plotkin Upper-Bound by having the maximum number of code words given by Plotkin Bound.