3 research outputs found
MacWilliams Identities for -tuple Weight Enumerators
Since MacWilliams proved the original identity relating the Hamming weight
enumerator of a linear code to the weight enumerator of its dual code there
have been many different generalizations, leading to the development of
-tuple support enumerators. We prove a generalization of theorems of Britz
and of Ray-Chaudhuri and Siap, which build on earlier work of Kl{\o}ve,
Shiromoto, Wan, and others. We then give illustrations of these -tuple
weight enumerators.Comment: 17 pages. Accepted to SIAM Journal on Discrete Mathematic
Applications of ordered weights in information transmission
This dissertation is devoted to a study of a class of linear codes related to a particular metric space that generalizes the Hamming space in that the metric function is defined by a partial order on the set of coordinates of the vector.
We begin with developing combinatorial and linear-algebraic aspects of linear ordered codes. In particular, we define multivariate rank enumerators for linear codes and show that they form a natural set of invariants in the study of the duality of linear codes. The rank enumerators are further shown to be connected to the shape distributions of linear codes, and enable us to give a simple proof of a MacWilliams-like theorem for the ordered case. We also pursue the connection between linear codes and matroids in the ordered case and show that the rank enumerator can be thought of as an instance of the classical matroid invariant called the Tutte polynomial. Finally, we consider the distributions of support weights of ordered codes and their expression via the rank enumerator. Altogether, these results generalize a group of well-known results for codes in the Hamming space to the ordered case.
Extending the research in the first part, we define simple probabilistic channel models that are in a certain sense matched to the ordered distance, and prove several results related to performance of linear codes on such channels. In particular, we define ordered wire-tap channels and establish several results related to the use of linear codes for reliable and secure transmission in such channel models.
In the third part of this dissertation we study polar coding schemes for channels with nonbinary input alphabets. We construct a family of linear codes that achieve the capacity of a nonbinary symmetric discrete memoryless channel with input alphabet of size q=2^r, r=2,3,.... A new feature of the coding scheme that arises in the nonbinary case is related to the emergence of several extremal configurations for the polarized data symbols. We establish monotonicity properties of the configurations and use them to show that total transmission rate approaches the symmetric capacity of the channel. We develop these results to include the case of ``controlled polarization'' under which the data symbols polarize to any predefined set of extremal configurations. We also outline an application of this construction to data encoding in video sequences of the MPEG-2 and H.264/MPEG-4 standards
Recommended from our members
Rational Point Counts for del Pezzo Surfaces over Finite Fields and Coding Theory
The goal of this thesis is to apply an approach due to Elkies to study the distribution of rational point counts for certain families of curves and surfaces over finite fields. A vector space of polynomials over a fixed finite field gives rise to a linear code, and the weight enumerator of this code gives information about point count distributions. The MacWilliams theorem gives a relation between the weight enumerator of a linear code and the weight enumerator of its dual code. For certain codes C coming from families of varieties where it is not known how to determine the distribution of point counts directly, we analyze low-weight codewords of the dual code and apply the MacWilliams theorem and its generalizations to gain information about the weight enumerator of C. These low-weight dual codes can be described in terms of point sets that fail to impose independent conditions on this family of varieties. Our main results concern rational point count distributions for del Pezzo surfaces of degree 2, and for certain families of genus 1 curves. These weight enumerators have interesting geometric and coding theoretic applications for small q.Mathematic