Related papers: Bifix codes and interval exchanges
In this paper we study the main characteristics of some evaluation codes parameterized by the edges of a bipartite graph with a perfect matching.
We introduce a formal framework to study the multiple unicast problem for a coded network in which the network code is linear over a finite field and fixed. We show that the problem corresponds to an interference alignment problem over a…
It is shown that some well-known and some new cyclic codes with orthogonal parity-check equations can be constructed in the finite-field transform domain. It is also shown that, for some binary linear cyclic codes, the performance of the…
The problem of correcting transpositions (or swaps) of consecutive symbols in $ q $-ary strings is studied. Lower bounds on asymptotically achievable rates of codes correcting $ t = \tau n $ transpositions are derived. The first bound is…
In this work, we use language modeling to investigate the factors that influence insertional code-switching. Code-switching occurs when a speaker alternates between one language variety (the primary language) and another (the secondary…
The intersection problem for additive (extended and non-extended) perfect codes, i.e. which are the possibilities for the number of codewords in the intersection of two additive codes C1 and C2 of the same length, is investigated. Lower and…
We adapt the vertical and horizontal insertion encodings of Cayley permutations to enumerate restricted growth functions, which are in bijection with unordered set partitions. For both insertion encodings, we fully classify the classes for…
We obtain explicit forms of the current best known asymptotic upper bounds for gaps between squarefree integers. In particular we show, for any $x \ge 2$, that every interval of the form $(x, x + 11x^{1/5}\log x]$ contains a squarefree…
Recent work in [53, 54] by the authors on periodic center manifolds and normal forms for bifurcations of limit cycles in delay differential equations (DDEs) motivates the derivation of explicit computational formulas for the critical normal…
A new class of codes, Extended Product (EPC) Codes, consisting of a product code with a number of extra parities added, is presented and applications for erasure decoding are discussed. An upper bound on the minimum distance of EPC codes is…
A criterion for unique ergodicity for points of a curve in the space of interval exchange transformation is given.
It is proved that almost every interval exchange transformation given by the symmetric permutation 1->m, 2->m-1,..., m-1->2, m->1, where m>1 is an odd number, is disjoint from ELF systems. The notion of ELF systems was introduced to express…
We investigate the packing and covering densities of linear and nonlinear binary codes, and establish a number of duality relationships between the packing and covering problems. Specifically, we prove that if almost all codes (in the class…
Given a code from a shift space to an irreducible sofic shift, any two of the following three conditions -- open, constant-to-one, (right or left) closing -- imply the third. If the range is not sofic, then the same result holds when…
We address the recently suggested problem of causal lossless coding of a randomly arriving source samples. We construct variable-to-fixed coding schemes and show that they outperform the previously considered fixed-to-variable schemes when…
Normal forms allow the use of a restricted class of coordinate transformations (typically homogeneous polynomials) to put the bifurcations found in nonlinear dynamical systems into a few standard forms. We investigate here the consequences…
We explore an approach to verification of programs via program transformation applied to an interpreter of a programming language. A specialization technique known as Turchin's supercompilation is used to specialize some interpreters with…
This paper presents a review of the phenomenon of interlayer exchange coupling in magnetic multilayers. The emphasis is put on a pedagogical presentation of the mechanism of the phenomenon, which has been successfully explained in terms of…
Multiplicity codes are algebraic error-correcting codes generalizing classical polynomial evaluation codes, and are based on evaluating polynomials and their derivatives. This small augmentation confers upon them better local decoding,…
An exact, one-to-one transform is presented that not only allows digital circular convolutions, but is free from multiplications and quantisation errors for transform lengths of arbitrary powers of two. The transform is analogous to the…