AI SearchAn investigation of algorithms for systematically choosing channel codes with large hamming distances
Call Number: AIT RSPR no. TC-94-09 Material type:
SeriesSeries: Asian Institute of Technology. Research studies project report ; no. TC-94-09Publication details: Bangkok : Asian Institute of Technology, 1994Description: 39 leavesSubject(s): Online resources: Dissertation note: Research Studies Project Report (M.Eng.) - Asian Institute of Technology, 1994 Summary: 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.
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
20-AIT Publication
|
Asian Institute of Technology Library AIT Publications | AIT RSPR no. TC-94-09 (Browse shelf(Opens below)) | 1 | Available | 30050003116711 | |||||||||||||
|
20-AIT Publication
|
Asian Institute of Technology Library AIT Publications | AIT RSPR no. TC-94-09 (Browse shelf(Opens below)) | 2 | Available | 30050003116703 | |||||||||||||
40-Archives
|
Asian Institute of Technology Library Archives | AIT RSPR no. TC-94-09 (Browse shelf(Opens below)) | 1 | Available | 30050120370290 |
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.
There are no comments on this title.