Show simple item record



Item Description

dc.contributor.author Yiu, Kai-Ping en_US
dc.date.accessioned 2009-09-09T19:36:53Z en_US
dc.date.available 2009-09-09T19:36:53Z en_US
dc.date.issued 1974 en_US
dc.identifier.uri http://hdl.handle.net/10125/11579 en_US
dc.description Typescript. en_US
dc.description Thesis (Ph. D.)--University of Hawaii at Manoa, 1974. en_US
dc.description Bibliography: leaves [112]-114. en_US
dc.description iv, 114 leaves en_US
dc.description.abstract A 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. en_US
dc.language.iso en-US en_US
dc.relation Theses for the degree of Doctor of Philosophy (University of Hawaii at Manoa). Electrical Engineering; no. 686 en_US
dc.rights All 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. en_US
dc.subject Coding theory en_US
dc.subject Error-correcting codes (Information theory) en_US
dc.subject Threshold logic en_US
dc.subject Computer programming en_US
dc.title A study of multifold Euclidean geometry codes en_US
dc.type Thesis en_US
dc.type.dcmi Text en_US

Item File(s)

Description Files Size Format View
Restricted for viewing only uhm_phd_7505044_r.pdf 3.345Mb PDF View/Open
For UH users only uhm_phd_7505044_uh.pdf 3.310Mb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search


Advanced Search

Browse

My Account

Statistics

About