No description available.

Thesis (M.S.)--University of Hawaii at Manoa, 2007. / Includes bibliographical references (leaves 50-51). / vii, 51 leaves, bound ill. 29 cm

Thesis (Ph. D.)--University of Texas at Austin, 2007. / Vita. Includes bibliographical references.

Thesis (M.S.)--West Virginia University, 2008. / Title from document title page. Document formatted into pages; contains ix, 66 p. : ill. (some col.). Includes abstract. Includes bibliographical references (p. 64-66).

Thesis (Ph. D.)--University of Washington, 2007. / Vita. Includes bibliographical references (p. 215-224).

Thesis (M.S.)--University of Florida, 2002. / Title from title page of source document. Document formatted into pages; contains xiii, 91 p.; also contains graphics. Includes vita. Includes bibliographical references.

Thesis (Ph. D.)--Oregon State University, 1995. / Typescript (photocopy). Includes bibliographical references (leaves 77-83). Also available on the World Wide Web.

Thesis--University of Wisconsin--Madison. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 153-156).

Thesis (Ph.D.)--University of Nebraska-Lincoln, 2006. / Title from title screen (site viewed May 23, 2007). PDF text: 114 p. ; 0.53 Mb UMI publication number: AAT 3237060. Includes bibliographical references. Also available in microfilm and microfiche formats.

M.Ing. / In practice, channels with only insertions and deletions are rare. More commonly, additive errors are also present. Therefore, additional redundancy bits are added to the encoded data stream to allow for insertion/deletion correction. In this dissertation, moment balancing templates are used to add a single insertion/deletion capability to an arbitrary additive-error-correcting code. Moment balancing can be used for systematic encoding of number-theoretic codes. The selection of a particular additive-error-correcting codebook has potential influence on the moment balancing template. In direct relation to this, partition distributions of linear sets are considered and their connection to moment balancing templates illustrated. As an alternative to fixed length moment balancing templates, a variable length approach to moment balancing is also considered. It is shown that variable length moment balancing templates result in better performance, in terms of redundancy, than the optimal fixed length moment balancing template. It is assumed that the boundaries of variable length Levenshtein codewords are known. To implement the variable length template in practice, multiple markers are needed. The delimitation of variable length codeword boundaries with these markers leads to longer marker sequences as compared with the fixed length templates.