A study of multifold Euclidean geometry codes

Simple item page
dc.contributor.authorYiu, Kai-Ping
dc.date.accessioned2009-09-09T19:36:53Z
dc.date.available2009-09-09T19:36:53Z
dc.date.issued1974
dc.descriptionTypescript.
dc.descriptionThesis (Ph. D.)--University of Hawaii at Manoa, 1974.
dc.descriptionBibliography: leaves [112]-114.
dc.descriptioniv, 114 leaves
dc.description.abstractA class of majority-logic decodable codes recently introduced by Lin, the multifold Euclidean geometry codes, is considered in this dissertation. An improvement of the multifold Euclidean geometry codes is presented. The improved multifold Euclidean geometry codes are shown to be more efficient than the original multifold Euclidean geometry codes while retaining the same majority-logic error-correcting capabilities. Based on the new definition of the improved multifold Euclidean geometry codes, it is easy to show that certain restrictions on the construction of multifold Euclidean geometry codes can be removed. Thus, the class of improved multifold Euclidean geometry codes is larger than the class of multifold Euclidean geometry codes defined by Lin. A simple decoding algorithm of the improved multifold Euclidean geometry codes is described. In some cases, each step of decoding can be made orthogonal. The improved multifold Euclidean geometry codes are shown to be maximal in the sense that they are the largest linear codes whose null spaces are spanned by all the (ยต,d+1) -frames in EG(m,q). The extensions of the improved multifold Euclidean geometry codes are shown to be invariant under the affine group of permutations. The algebraic structures of the improved multifold Euclidean geometry codes based on primitive BCH codes are investigated. It is shown that this class of improved multifold Euclidean geometry codes is more efficient than the dual of polynomial codes with the same majority-logic error-correcting capabilities. In the case where the minimum distance of the base code divides the length of the base code, the corresponding improved multifold Euclidean geometry codes are shown to be identical to a subclass of regular generalized Euclidean geometry codes. Finally, a generalization of the improved multifold Euclidean geometry codes is briefly discussed. The multifold generalized Euclidean geometry codes contain the regular generalized Euclidean geometry codes as a subclass.
dc.identifier.urihttp://hdl.handle.net/10125/11579
dc.language.isoen-US
dc.relationTheses for the degree of Doctor of Philosophy (University of Hawaii at Manoa). Electrical Engineering; no. 686
dc.rightsAll UHM dissertations and theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission from the copyright owner.
dc.subjectCoding theory
dc.subjectError-correcting codes (Information theory)
dc.subjectThreshold logic
dc.subjectComputer programming
dc.titleA study of multifold Euclidean geometry codes
dc.typeThesis
dc.type.dcmiText

Files

Original bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
uhm_phd_7505044_r.pdf
Size:
3.35 MB
Format:
Adobe Portable Document Format
Description:
Version for non-UH users. Copying/Printing is not permitted
Download
No Thumbnail Available
Name:
uhm_phd_7505044_uh.pdf
Size:
3.31 MB
Format:
Adobe Portable Document Format
Description:
Version for UH users
Download

Collections

Ph.D. - Electrical Engineering