Related papers: On continuing codes
There are often multiple ways to implement the same requirement in source code. Different implementation choices can result in code snippets that are similar, and have been defined in multiple ways: code clones, examples, simions and…
The discrete Fourier transform and the FFT algorithm are extended from the circle to continuous graphs with equal edge lengths.
In this article we study invariance properties of shift-invariant spaces in higher dimensions. We state and prove several necessary and sufficient conditions for a shift-invariant space to be invariant under a given closed subgroup of…
It is widely claimed that the quantile function is equivariant under increasing transformations. We show by a counterexample that this is not true (even for strictly increasing transformations). However, we show that the quantile function…
Given a continuous real-valued function on [0, 1], and a closed subset E \subset [0, 1] we denote by f E the restriction of f to E, that is, the function defined only on E that takes the same values as f at every point of E >. The…
Every (left) linear function on a subspace of a finite-dimensional vector space over a (skew) field can be extended to a (left) linear function on the whole space. This paper explores the extent to what this basic fact of linear algebra is…
We consider discrete metric spaces and we look for non-constant contractions. We introduce the notion of contractive map and we characterize the spaces with non-constant contractive maps. We provide some examples to discussion the possible…
The design of block codes for short information blocks (e.g., a thousand or less information bits) is an open research problem which is gaining relevance thanks to emerging applications in wireless communication networks. In this work, we…
It is well known, as follows from the Banach-Steinhaus theorem, that if a sequence $\left\{y_{n}\right\}_{n=1}^{\infty}$ of linear continuous functionals in a Fr\'echet space converges pointwise to a linear functional $Y,$ $Y\left( x\right)…
For a fixed topological Markov shift, we consider measure-preserving dynamical systems of Gibbs measures for 2-locally constant functions on the shift. We also consider isomorphisms between two such systems. We study the set of all…
We consider recurrent diffusive random walks on a strip. We present constructive conditions on Green functions of finite sub-domains which imply a Central Limit Theorem with polynomial error bound, a Local Limit Theorem, and mixing of…
Consider a difference equation which takes the k-th largest output of m functions of the previous m terms of the sequence. If the functions are also allowed to change periodically as the difference equation evolves this is analogous to a…
Spatially-coupled (SC) LDPC codes have recently emerged as an excellent choice for error correction in modern data storage and communication systems due to their outstanding performance. It has long been known that irregular graph codes…
We give the class of finite groups which arise as the permutation groups of cyclic codes over finite fields. Furthermore, we extend the results of Brand and Huffman et al. and we find the properties of the set of permutations by which two…
A strong blocking set in a finite projective space is a set of points that intersects each hyperplane in a spanning set. We provide a new graph theoretic construction of such sets: combining constant-degree expanders with asymptotically…
We study the behavior of various set-functions under holomorphic motions. We show that, under such deformations, logarithmic capacity varies continuously, while analytic capacity may not.
While modal extensions of decidable fragments of first-order logic are usually undecidable, their monodic counterparts, in which formulas in the scope of modal operators have at most one free variable, are typically decidable. This only…
We define a variable-length code having the property that no (non-empty) prefix of each its codeword is a suffix of any other one, and vice versa. This kind of code can be seen as an extension of two well-known codes in literature, called…
We afford the problem of counting the blocks of a given length made with symbols drawn from an alphabet and relate this number to Fibonacci-like recurrent relations. The recurrence polynomia allows to calculate the limit ratio of two…
The existence of non-continuous invariant graphs (or strange non-chaotic attractors) in quasiperiodically forced systems has generated great interest, but there are still very few rigorous results about the properties of these objects. In…