Related papers: On Isometries for Convolutional Codes
In this thesis, the main objects of study are probability measures on the isomorphism classes of countable, connected rooted graphs. An important class of such measures is formed by unimodular measures, which satisfy a certain equation,…
Cyclicity of a convolutional code (CC) is relying on a nontrivial automorphism of the algebra F[x]/(x^n-1), where F is a finite field. If this automorphism itself has certain specific cyclicity properties one is lead to the class of…
An equivalence relation called isometry is introduced to classify constacyclic codes over a finite field; the polynomial generators of constacyclic codes of length $\ell^tp^s$ are characterized, where $p$ is the characteristic of the finite…
In this paper, we consider codes over finite fields, finite abelian groups, and finite Frobenius rings. For such codes, the complete weight enumerator and the Hamming weight enumerator serve as powerful tools. These two types of weight…
We study the conditions under which the isometry of spaces with metrics generated by weights given on the edges of finite trees is equivalent to the isomorphism of these trees. Similar questions are studied for ultrametric spaces generated…
We define a simple, explicit map sending a morphism $f:M \rightarrow N$ of pointwise finite dimensional persistence modules to a matching between the barcodes of $M$ and $N$. Our main result is that, in a precise sense, the quality of this…
The 1+3 covariant approach and the covariant gauge-invariant approach to perturbations are used to analyze in depth conformal transformations in cosmology. Such techniques allow us to obtain very interesting insights on the physical content…
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…
The properties of discrete nonlinear symmetries of integrable equations are investigated. These symmetries are shown to be canonical transformations. On the basis of the considered examples, it is concluded, that the densities of the…
The velocity of light is invariant under transformations that alter space-time metrics, while leaving Maxwell's equations invariant. A one-parameter special conformal invariance group of the equations exposes an ambiguity in current…
This is a chapter of the upcoming "A Concise Encyclopedia of Coding Theory", W.C. Huffman, J.-L. Kim, and P. Sole' Eds., CRC Press. The chapter gives an introduction to the mathematical theory of rank-metric codes. Treated topics include:…
The gauge polyvalence of a new numerical code is tested, both in harmonic-coordinate simulations (gauge-waves testbed) and in singularity-avoiding coordinates (simple Black-Hole simulations, either with or without shift). The code is built…
The output of persistent homology is an algebraic object called a persistence module. This object admits a decomposition into a direct sum of interval persistence modules described entirely by the barcode invariant. In this paper we…
Within a category $\mathtt{C}$, having objects $\mathtt{C}_0$, it may be instructive to know not only that two objects are non-isomorphic, but also how far from being isomorphic they are. We introduce pseudo-metrics $d:\mathtt{C}_0 \times…
The weight generating functions associated with convolutional codes (CCs) are based on state space realizations or the weight adjacency matrices (WAMs). The MacWilliams identity for CCs on the WAMs was first established by Gluesing-…
Standard convolutions are prevalent in image processing and deep learning, but their fixed kernels limits adaptability. Several deformation strategies of the reference kernel grid have been proposed. Yet, they lack a unified theoretical…
Barcodes form a complete set of invariants for interval decomposable persistence modules and are an important summary in topological data analysis. The set of barcodes is equipped with a canonical one-parameter family of metrics, the…
In this paper, we mainly focus on formal deformation theory of module homomorphisms. We first introduce the cohomology of module homomorphisms and study formal one-parameter deformation. We obtain some properties about obstructions. Then we…
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…
Permutation codes have recently garnered substantial research interest due to their potential in various applications including cloud storage systems, genome resequencing and flash memories. In this paper, we study the theoretical bounds…