Related papers: Explicit Formulas for the Weight Enumerators of So…
Automated model selection is often proposed to users to choose which machine learning model (or method) to apply to a given regression task. In this paper, we show that combining different regression models can yield better results than…
Cyclic codes are a subclass of linear codes and have wide applications in consumer electronics, data storage systems, and communication systems due to their efficient encoding and decoding algorithms. Cyclic codes with many zeros and their…
The paper describes a method to determine symmetrized weight enumerators of $p^m$-linear codes based on the notion of a disjoint weight enumerator. Symmetrized weight enumerators are given for the lifted quadratic residue codes of length 24…
In our setting enumeration amounts to generate all solutions of a problem instance without duplicates. We address the problem of enumerating the models of B-formulae. A B-formula is a propositional formula whose connectives are taken from a…
We introduce a general class of regular weight functions on finite abelian groups, and study the combinatorics, the duality theory, and the metric properties of codes endowed with such functions. The weights are obtained by composing a…
Linear programming approaches have been applied to derive upper bounds on the size of classical codes and quantum codes. In this paper, we derive similar results for general quantum codes with entanglement assistance, including nonadditive…
The insertion-deletion codes were motivated to correct the synchronization errors. In this paper we prove several coordinate-ordering-free upper bounds on the insdel distances of linear codes, which are based on the generalized Hamming…
The weight enumerators (quant-ph/9610040) of a quantum code are quite powerful tools for exploring its structure. As the weight enumerators are quadratic invariants of the code, this suggests the consideration of higher-degree polynomial…
Tensor codes are a generalisation of matrix codes. Such codes are defined as subspaces of order-r tensors for which the ambient space is endowed with the tensor-rank as a metric. A class of these codes was introduced by Roth, who also…
This paper investigates the relation between linear codes and the stabilizer in ${\rm GL}_2(\mathbb{C})$ of their weight enumerators. We prove a result on the finiteness of stabilizers and give a complete classification of linear codes with…
In this paper, we first generalize the class of linear codes by Ding and Ding (IEEE TIT, 61(11), pp. 5835-5842, 2015). Then we mainly study the augmented codes of this generalized class of linear codes. For one thing, we use Gaussian sums…
We provide a combinatorial construction for linear codes attaining the maximum possible number of distinct weights. We then introduce the related problem of determining the existence of linear codes with an arbitrary number of distinct…
Motivated by the duplication-correcting problem for data storage in live DNA, we study the construction of constant-weight codes in $\ell_1$-metric. By using packings and group divisible designs in combinatorial design theory, we give…
The weight decision problem, which requires to determine the Hamming weight of a given binary string, is a natural and important problem, with applications in cryptanalysis, coding theory, fault-tolerant circuit design and so on. In…
The large memory requirements of deep neural networks limit their deployment and adoption on many devices. Model compression methods effectively reduce the memory requirements of these models, usually through applying transformations such…
Let $\mathfrak{g}$ be a complex Kac-Moody algebra, with Cartan subalgebra $\mathfrak{h}$. Also fix a weight $\lambda\in\mathfrak{h}^*$. For $M(\lambda)\twoheadrightarrow V$ an arbitrary highest weight $\mathfrak{g}$-module, we provide a…
The coverage depth problem in DNA data storage is about computing the expected number of reads needed to recover all encoded strands. Given a generator matrix of a linear code, this quantity equals the expected number of randomly drawn…
A suitable choice of the representation of candidate solutions is crucial for the efficiency of evolutionary algorithms and related metaheuristics. We focus on problems in permutation spaces, which are at the core of numerous practical…
The Generalized Hamming weights and their relative version, which generalize the minimum distance of a linear code, are relevant to numerous applications, including coding on the wire-tap channel of type II, $t$-resilient functions,…
In this paper, we focus on the design of binary constant weight codes that admit low-complexity encoding and decoding algorithms, and that have a size $M=2^k$. For every integer $\ell \geq 3$, we construct a $(n=2^\ell, M=2^{k_{\ell}},…