Thesis (Ph. D.)--Hong Kong University of Science and Technology, 2004. / Includes bibliographical references (leaves 94-101). Also available in electronic version. Access restricted to campus users.

Thesis (Ph. D.)--University of Hong Kong, 2009. / Includes bibliographical references (leaves 122-128). Also available in print.

Thesis (M.S.)--Virginia Polytechnic Institute and State University, 1993. / Vita. Abstract. Includes bibliographical references (leaves 88-91). Also available via the Internet.

Thesis (Ph. D.)--University of Wisconsin, 1967. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliography.

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

Thesis (Ph. D.)--West Virginia University, 2007. / Title from document title page. Document formatted into pages; contains xiv, 161 p. : ill. (some col.). Includes abstract. Includes bibliographical references (p. 152-161).

Thesis (Ph. D.)--Ohio State University, 2007. / Title from first page of PDF file. Includes bibliographical references (p. 109-114).

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

D.Ing. / When digital information is to be transmitted over a communications channel or stored in a data recording system, it is first mapped onto a code sequence by an encoder. The code sequence has certain properties which makes it suitable for use on the channel, ie the sequence complies to the channel input restrictions. These input restrictions are often described in terms of a required power spectral density of the code sequence. In addition, the code sequence can also be chosen in such a way as to enable the receiver to correct errors which occur in the channel. The set of rules which governs the encoding process is referred to as a line code or a modulation code for the transmission or storage of data, respectively. Before a new line code or modulation code can be developed, the properties that the code sequence should have for compliance to the channel input, restrictions and possession of desired error correction capabilities have to be established. A code' construction algorithm, which is often time consuming and difficult to apply, is then used to obtain the new code. In this dissertation, new classes of sequences which comply to the input restrictions and error correction requirements of practical channels are defined, and new line codes and recording codes are developed for mapping data onto these sequences. Several theorems which show relations between' information theoretical aspects of different classes of code sequences are presented. Algorithms which can be used to transform an existing line code or modulation code into a new code for use on another channel are introduced. These algorithms are systematic and easy to apply, and precludes the necessity of applying a code construction algorithm.

M.Ing. / Certain properties of codewords after deletions or insertions of bits are investigated. This is used in the enumeration of the number of subwords or superwords after deletions or insertions. Also, new upper bounds for insertion/deletion correcting codes are derived from these properties. A decoding algorithm to correct up to two deletions per word for Helberg's s = 2 codes is proposed. By using subword and superword tables, new s = 2 codebooks with greater cardinalities than before are presented. An insertion/deletion channel model is presented which can be used in evaluating insertion/deletion correcting codes. By changing the parameters, various channel configurations can be attained. Furthermore, a new convolutional coding scheme for correcting insertion/deletion errors is introduced and an investigation of the performance is done by using the presented channel model.