21 research outputs found
Codes, arrangements, matroids, and their polynomial links
Codes, arrangements, matroids, and their polynomial links Many mathematical objects are closely related to each other. While studying certain aspects of a mathematical object, one tries to find a way to "view" the object in a way that is most suitable for a specific problem. Or, in other words, one tries to find the best way to model the problem. Many related fields of mathematics have evolved from one another this way. In practice, it is very useful to be able to transform a problem into other terminology: it gives a lot more available knowledge and that can be helpful to solve a problem. This thesis deals with various closely related fields in discrete mathematics, starting from linear error-correcting codes and their weight enumerator. We can generalize the weight enumerator in two ways, to the extended and generalized weight enumerators. The set of generalized weight enumerators is equivalent to the extended weight enumerator. Summarizing and extending known theory, we define the two-variable zeta polynomial of a code and its generalized zeta polynomial. These polynomials are equivalent to the extended and generalized weight enumerator of a code. We can determine the extended and generalized weight enumerator using projective systems. This calculation is explicitly done for codes coming from finite projective and affine spaces: these are the simplex code and the first order Reed-Muller code. As a result we do not only get the weight enumerator of these codes, but it also gives us information on their geometric structure. This is useful information in determining the dimension of geometric designs. To every linear code we can associate a matroid that is representable over a finite field. A famous and well-studied polynomial associated to matroids is the Tutte polynomial, or rank generating function. It is equivalent to the extended weight enumerator. This leads to a short proof of the MacWilliams relations for the extended weight enumerator. For every matroid, its flats form a geometric lattice. On the other hand, every geometric lattice induces a simple matroid. The Tutte polynomial of a matroid determines the coboundary polynomial of the associated geometric lattice. In the case of simple matroids, this becomes a two-way equivalence. Another polynomial associated to a geometric lattice (or, more general, to a poset) is the Möbius polynomial. It is not determined by the coboundary polynomial, neither the other way around. However, we can give conditions under which the Möbius polynomial of a simple matroid together with the Möbius polynomial of its dual matroid defines the coboundary polynomial. The proof of these relations involves the two-variable zeta polynomial, that can be generalized from codes to matroids. Both matroids and geometric lattices can be truncated to get an object of lower rank. The truncated matroid of a representable matroid is again representable. Truncation formulas exist for the coboundary and Möbius polynomial of a geometric lattice and the spectrum polynomial of a matroid, generalizing the known truncation formula of the Tutte polynomial of a matroid. Several examples and counterexamples are given for all the theory. To conclude, we give an overview of all polynomial relations
Bounds on the size of codes
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 (list-decodable codes). In this context we
recover the best known estimate on the size of list-decodable codes in
a new way
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
LIPIcs, Volume 251, ITCS 2023, Complete Volume
LIPIcs, Volume 251, ITCS 2023, Complete Volum
Recommended from our members
Quantum meets optimization and machine learning
With the advent of the quantum era, what role the quantum computer will play in optimization and machine learning becomes a natural and salient question. The development of novel quantum computing techniques is essential to showcase the quantum advantage in these fields. At the same time, new findings in classical optimization and machine learning algorithms also have the potential to stimulate quantum computing research. In the dissertation, we explore the fascinating connections between quantum computing, optimization, and machine learning, paving the way for transformative advances in all three fields. First, on the quantum side, we present efficient quantum algorithms for fundamental problems in sampling, optimization, and quantum physics. Our results highlight the practical advantages of quantum computing in these fields. In addition, we introduce new approaches to quantum complexity theory for characterizing the quantum hardness of optimization and machine learning problems. Second, on the optimization side, we improve the efficiency of the state-of-the-art classical algorithms for solving semi-definite programming (SDP), Fourier sensing, dynamic distance estimation, etc. Our classical results are closely intertwined with quantum computing. Some of them serve as stepping stones to new quantum algorithms, while others are motivated by quantum applications or inspired by quantum techniques. Third, on the machine learning side, we develop fast classical and quantum algorithms for training over-parameterized neural networks with provable guarantees of convergence and generalization. Furthermore, we contribute to the security aspect of machine learning by theoretically investigating some potential approaches to (classically) protect private data in collaborative machine learning and to (quantumly) protect the copyright of machine learning models. Fourth, we investigate the concentration and discrepancy properties of hyperbolic polynomials and higher-order random walks, which could potentially be applied to quantum computing, optimization, and machine learning.Computer Science