Title of dissertation : BOUNDS ON THE SIZE OF CODES
نویسندگان
چکیده
Title of dissertation: BOUNDS ON THE SIZE OF CODES Punarbasu Purkayastha Doctor of Philosophy, 2010 Dissertation directed by: Professor Alexander Barg Department of Electrical and Computer Engineering and The Institute for Systems Research In this dissertation we determine new bounds and properties of codes in three different finite metric spaces, namely the ordered Hamming space, the binary Hamming space, and the Johnson space. The ordered Hamming space is a generalization of the Hamming space that arises in several different problems of coding theory and numerical integration. Structural properties of this space are well described in the framework of Delsarte’s theory of association schemes. Relying on this theory, we perform a detailed study of polynomials related to the ordered Hamming space and derive new asymptotic bounds on the size of codes in this space which improve upon the estimates known earlier. A related project concerns linear codes in the ordered Hamming space. We define and analyze a class of near-optimal codes, called near-Maximum Distance Separable codes. We determine the weight distribution and provide constructions of such codes. Codes in the ordered Hamming space are dual to a certain type of point distributions in the unit cube used in numerical integration. We show that near-Maximum Distance Separable codes are equivalently represented as certain near-optimal point distributions. In the third part of our study we derive a new upper bound on the size of a family of subsets of a finite set with restricted pairwise intersections, which improves upon the well-known Frankl-Wilson upper bound. The new bound is obtained by analyzing a refinement of the association scheme of the Hamming space (the Terwilliger algebra) and intertwining functions of the symmetric group. Finally, in the fourth set of problems we determine new estimates on the size of codes in the Johnson space. We also suggest a new approach to the derivation of the well-known Johnson bound for codes in this space. Our estimates are often valid in the region where the Johnson bound is vacuous. We show that these methods are also applicable to the case of multiple packings in the Hamming space (listdecodable codes). In this context we recover the best known estimate on the size of list-decodable codes in a new way. BOUNDS ON THE SIZE OF CODES
منابع مشابه
Title: Investigating the Factors Affecting on the Experiences of Medical Students of Guilan University of Medical Sciences
Introduction : By passing part of their course in research-based education, medical students are deeply involved in the research field. The purpose of this study was to determine the factors affecting the research experiences of medical students of Guilan University of Medical Sciences so that positive factors could be promoted in the development of research experiences and effective steps were...
متن کاملDecoding of Block and Convolutional Codes in Rank Metric DISSERTATION
Rank-metric codes recently attract a lot of attention due to their possible application to network coding, cryptography, space-time coding and distributed storage. An optimal-cardinality algebraic code construction in rank metric was introduced some decades ago by Delsarte, Gabidulin and Roth. This Reed–Solomon-like code class is based on the evaluation of linearized polynomials and is nowadays...
متن کاملTitle of dissertation: UNIVERSAL BOUNDS ON COARSENING RATES FOR SOME MODELS OF PHASE TRANSITIONS
Title of dissertation: UNIVERSAL BOUNDS ON COARSENING RATES FOR SOME MODELS OF PHASE TRANSITIONS Shibin Dai, Doctor of Philosophy, 2005 Dissertation directed by: Professor Robert L. Pego Department of Mathematics In this thesis, we prove one-sided, universal bounds on coarsening rates for three models of phase transitions by following a strategy developed by Kohn and Otto (Comm. Math. Phys. 229...
متن کاملAn approach to fault detection and correction in design of systems using of Turbo codes
We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...
متن کاملBounds on $m_r(2,29)$
An $(n, r)$-arc is a set of $n$ points of a projective plane such that some $r$, but no $r+1$ of them, are collinear. The maximum size of an $(n, r)$-arc in PG(2, q) is denoted by $m_r(2,q)$. In this paper thirteen new $(n, r)$-arc in PG(2,,29) and a table with the best known lower and upper bounds on $m_r(2,29)$ are presented. The results are obtained by non-exhaustive local computer search.
متن کامل