Please use this identifier to cite or link to this item:

A covering space approach to (d,k) constrained codes

File Description Size Format  
uhm phd 9230512 r.pdf Version for non-UH users. Copying/Printing is not permitted 2.42 MB Adobe PDF View/Open
uhm phd 9230512 uh.pdf Version for UH users 2.38 MB Adobe PDF View/Open

Item Summary

Title:A covering space approach to (d,k) constrained codes
Authors:Perry, Patrick Neil
Date Issued:1992
Abstract:The capacity of the (d, k) constrained codes and of the (d, k) L level charge constrained codes is considered. The case of rational capacity is examined. and an error in the literature is corrected. This leads to an interesting (0.3)L = 4 level charge constrained code. The error control for this code is done using the finite field GF(3). A table of the ternary convolutional codes of greatest free distance is given for possible applications. The topological properties of the (d, k) constraint graphs are examined. The fundamental group of a constraint graph and covering spaces of a constraint graph are discussed. A constructive process for building a covering space of a constraint graph is given. The construction of (d, k) constrained block codes from covering spaces of the (d, k) constraint graph is examined. Several types of block codes are introduced. The base point codes consist of the (d, k) constrained sequences whose associated edge paths in the covering space are loops at a specified vertex. The parity point codes consist of the (d, k) constrained sequences whose associated edge paths in the covering space conned two specified vertices. It is shown that an [n, k] cyclic code can be constructed as a base point code for a 2^(n-k) fold covering of the (0,∞) constraint graph. Systematic (d, k) constrained block codes are constructed for detecting all single shift errors, drop in errors, and drop out errors. The average probability of an undetected error for the systematic (d, k) constrained block codes is shown to decrease exponentially with the parity length times the capacity of a (d, k) constrained code.
Description:Thesis (Ph. D.)--University of Hawaii at Manoa, 1992.
Includes bibliographical references (leaves 102-104)
ix, 104 leaves, bound ill. 29 cm
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.
Appears in Collections: Ph.D. - Mathematics
Ph.D. Dissertations- Mathematics Department

Please email if you need this content in ADA-compliant format.

Items in ScholarSpace are protected by copyright, with all rights reserved, unless otherwise indicated.