An Salam, Abdus creator O'Farrell, T. Chairperson (Chairman - upto 31/10/1994) Makelainen, Kimmo Chairperson Ahmed, Kumar M. Examination committee Sharma, A.B. Examination Committee Finnish International Development Agency (FINNIDA) Scholarship donor text series technical report th Bangkok Asian Institute of Technology 1994 continuing eng 39 leaves 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. 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 Error-correcting codes (Information theory) Algorithms Asian Institute of Technology. http://203.159.5.9/ait-thesis/detail.php?q=B15562 http://203.159.5.9/ait-thesis/detail.php?q=B15562 121095 20260818144313.0