Caltech Library System

About | Browse | Search | Caltech Student Instructions

Type of Document	Dissertation
Author	Yildiz, Bahattin
Author's Email Address	bahattin AT caltech.edu
URN	etd-05182006-171405
Persistent URL	http://resolver.caltech.edu/CaltechETD:etd-05182006-171405
Title	Weight enumerators and gray maps of linear codes over rings
Degree	PhD
Option	Mathematics
Advisory Committee	Advisor Name Title Richard M. Wilson Committee Chair David Wales Committee Member Dinakar Ramakrishnan Committee Member Robert J. McEliece Committee Member
Keywords	permutation invariance Gray maps weight enumrators Galois Rings Linear Codes MacWilliams Identities
Date of Defense	2006-05-10
Availability	restricted
Abstract The main focus in this thesis is linear codes over rings. In the first part, we look at linear codes over Galois rings, and using the homogeneous weight, we improve upon Wilson's results about the prime power that divides the coefficients of the homogeneous weight enumerators of these codes. We also prove that our results are best possible. Our results about homogeneous weight enumerators of linear codes over Galois rings generalize the results that we have for the Lee weight enumerators of linear codes over the ring of integers modulo 4. We also consider other weight enumerators, in particular the complete weight enumerators of linear codes and we obtain MacWilliams-like identities for these weight enumerators considering different rings. These MacWilliams-like identities lead to MacWilliams identities for the Hamming weight enumerators of linear codes over rings. We also give a counter-example to show that we cannot have MacWilliams-like identities for the Euclidean weight enumerators of linear codes over the ring of integers modulo 4. We also look at Gray maps from Galois rings to the finite field of prime size. We first give an application of the distance preserving Gray maps to obtain good ternary codes, and then we give an inductive algebraic construction of a distance preserving Gray map from Galois rings with the homogeneous distance to the field of prime size with the Hamming distance as well as a combinatorial construction. By using the Gray maps, we obtain some results about the weight enumerators of linear codes over the ring of dual numbers. In the last part of this work, we consider the permutation invariance of binary codes and the connection with linearity over certain rings. Among the rings considered, we have different variations and extensions of the ring of dual numbers. In this context we consider the Reed-Muller codes and answer questions about permutation invariance of Reed-Muller codes under certain permutation groups and the linearity of Reed-Muller codes over these aforementioned rings.
Files	Filename       Size       Approximate Download Time (Hours:Minutes:Seconds)     28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access  thesis_2.pdf 644.26 Kb 00:02:58 00:01:32 00:01:20 00:00:40 00:00:03 indicates that a file or directory is accessible from the campus network only and must not be distributed to non-campus persons.