Searcharxiv⌕ Search

arXiv subjects

Moshe Schwartz

Publications and source records attributed to Moshe Schwartz.

At least 73 records · Page 4Linked to original sources
arXiv2017

On Independence and Capacity of Multidimensional Semiconstrained Systems

We find a new formula for the limit of the capacity of certain sequences of multidimensional semiconstrained systems as the dimension tends to infinity. We do so by generalizing the notion of independence entropy, originally studied in the context of constrained systems, to the study of semiconstrained systems. Using the independence entropy, we obtain new lower bounds on the capacity of multidimensional semiconstrained systems in general, and $d$-dimensional axial-product systems in particular. In the case of the latter, we prove our bound is asymptotically tight, giving the exact limiting capacity in terms of the independence entropy. We show the new bound improves upon the best-known bound in a case study of $(0,k,p)$-RLL.

math.DS↗
arXiv2017

Rank modulation codes for DNA storage

Synthesis of DNA molecules offers unprecedented advances in storage technology. Yet, the microscopic world in which these molecules reside induces error patterns that are fundamentally different from their digital counterparts. Hence, to maintain reliability in reading and writing, new coding schemes must be developed. In a reading technique called shotgun sequencing, a long DNA string is read in a sliding window fashion, and a profile vector is produced. It was recently suggested by Kiah et al. that such a vector can represent the permutation which is induced by its entries, and hence a rank-modulation scheme arises. Although this interpretation suggests high error tolerance, it is unclear which permutations are feasible, and how to produce a DNA string whose profile vector induces a given permutation. In this paper, by observing some necessary conditions, an upper bound for the number of feasible permutations is given. Further, a technique for deciding the feasibility of a permutation is devised. By using insights from this technique, an algorithm for producing a considerable number of feasible permutations is given, which applies to any alphabet size and any window length.

cs.IT↗
arXiv2017

Single Particle Brownian Motion with Solid Friction

We study the Brownian dynamics of a solid particle on a vibrating solid surface. Phenomenologically, the interaction between the two solid surfaces is modeled by solid friction, and the Gaussian white noise models the vibration of the solid surface. The solid friction is proportional to the sign of relative velocity. We derive the Fokker-Planck (FP) equation for the time-dependent probability distribution to find the particle at a given location. We calculate analytically the steady state velocity distribution function, mean-squared velocity and diffusion coefficient in $d$ dimensions. We present a generic method of calculating the autocorrelations in $d$ dimensions. This results in one dimension in an exact evaluation of the steady state velocity autocorrelation. In higher dimensions, our exact general expression enables the analytic evaluation of the autocorrelation to any required approximation. We present approximate analytic expressions in two and three dimensions. Next, we numerically calculate the mean-square velocity and steady state velocity autocorrelation function up to $d=3$. Our numerical results are in good agreement with the analytically obtained results.

cond-mat.stat-mech↗
arXiv2017

Improved Lower Bounds on the Size of Balls over Permutations with the Infinity Metric

We study the size (or volume) of balls in the metric space of permutations, $S_n$, under the infinity metric. We focus on the regime of balls with radius $r = ρ\cdot (n\!-\!1)$, $ρ\in [0,1]$, i.e., a radius that is a constant fraction of the maximum possible distance. We provide new lower bounds on the size of such balls. These new lower bounds reduce the asymptotic gap to the known upper bounds to at most $0.029$ bits per symbol. Additionally, they imply an improved ball-packing bound for error-correcting codes, and an improved upper bound on the size of optimal covering codes.

cs.IT↗
arXiv2017

Jamming in hard sphere suspensions under shear

We consider a system of monodisperse hard spheres immersed in a sheared fluid. We obtain the distortion of the structure factor of the hard spheres at low shear rates, within a Percus-Yevick like framework. The consequent distortion of the pair distribution function is shown to affect the transition of the hard sphere fluid into a jammed state, which is similar to the transition to the state of random close packing in the absence of shear.

cond-mat.stat-mech↗
arXiv2017

Frictional Cooling of Granular Gases: A Molecular Dynamics Study

We study the free evolution of frictional granular gases using large scale molecular dynamics simulation in three dimensions. The system cools due to solid friction among the interacting particles. At early stages of evolution, the density field remains homogeneous and the velocity field follows the Maxwell-Boltzmann (MB) distribution. However, at later times, the density field shows clustering and the velocity field shows local ordering. The ordering in the velocity field is studied by invoking analogy from phase ordering systems. The equal-time correlation function of velocity field follows dynamical scaling. The correlation length of velocity field, $L_v(t)$, exhibits power law growth: $L_v(t)\sim t^{1/3}$.

cond-mat.stat-mech↗
arXiv2017

Infinity-Norm Permutation Covering Codes from Cyclic Groups

We study covering codes of permutations with the $\ell_\infty$-metric. We provide a general code construction, which uses smaller building-block codes. We study cyclic transitive groups as building blocks, determining their exact covering radius, and showing linear-time algorithms for finding a covering codeword. We also bound the covering radius of relabeled cyclic transitive groups under conjugation.

cs.IT↗
arXiv2016

Encoding Semiconstrained Systems

Semiconstrained systems were recently suggested as a generalization of constrained systems, commonly used in communication and data-storage applications that require certain offending subsequences be avoided. In an attempt to apply techniques from constrained systems, we study sequences of constrained systems that are contained in, or contain, a given semiconstrained system, while approaching its capacity. In the case of contained systems we describe to such sequences resulting in constant-to-constant bit-rate block encoders and sliding-block encoders. Surprisingly, in the case of containing systems we show that a "generic" semiconstrained system is never contained in a proper fully-constrained system.

cs.IT↗
arXiv2016

Yield statistics of interpolated superoscillations

Yield Optimized Interpolated Superoscillations (YOIS) have been recently introduced as a means for possibly making the use of the phenomenon of superoscillation practical. In this paper we study how good is a superoscillation that is not optimal. Namely, by how much is the yield decreased when the signal departs from the optimal one. We consider two situations. One is the case where the signal strictly obeys the interpolation requirement and the other is when that requirement is relaxed. In the latter case the yield can be increased at the expense of deterioration of signal quality. An important conclusion is that optimizing superoscillations may be challenging in terms of the precision needed, however, storing and using them is not at all that sensitive. This is of great importance in any physical system where noise and error are inevitable.

cond-mat.stat-mech↗
arXiv2016

Clustering and Velocity Distributions in Granular Gases Cooling by Solid Friction

We present large-scale molecular dynamics simulations to study the free evolution of granular gases. Initially, the density of particles is homogeneous and the velocity follows a Maxwell-Boltzmann (MB) distribution. The system cools down due to solid friction between the granular particles. The density remains homogeneous, and the velocity distribution remains MB at early times, while the kinetic energy of the system decays with time. However, fluctuations in the density and velocity fields grow, and the system evolves via formation of clusters in the density field and the local ordering of velocity field, consistent with the onset of plug flow. This is accompanied by a transition of the velocity distribution function from MB to non-MB behaviour. We used equal-time correlation functions and structure factors of the density and velocity fields to study the morphology of clustering. From the correlation functions, we obtain the cluster size, $L$, as a function of time, $t$. We show that it exhibits power law growth with $L(t)\sim t^{1/3}$

cond-mat.stat-mech↗
arXiv2016

Limited-Magnitude Error-Correcting Gray Codes for Rank Modulation

We construct Gray codes over permutations for the rank-modulation scheme, which are also capable of correcting errors under the infinity-metric. These errors model limited-magnitude or spike errors, for which only single-error-detecting Gray codes are currently known. Surprisingly, the error-correcting codes we construct achieve a better asymptotic rate than that of presently known constructions not having the Gray property, and exceed the Gilbert-Varshamov bound. Additionally, we present efficient ranking and unranking procedures, as well as a decoding procedure that runs in linear time. Finally, we also apply our methods to solve an outstanding issue with error-detecting rank-modulation Gray codes (snake-in-the-box codes) under a different metric, the Kendall $τ$-metric, in the group of permutations over an even number of elements $S_{2n}$, where we provide asymptotically optimal codes.

cs.IT↗
arXiv2016

Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms

The ability to store data in the DNA of a living organism has applications in a variety of areas including synthetic biology and watermarking of patented genetically-modified organisms. Data stored in this medium is subject to errors arising from various mutations, such as point mutations, indels, and tandem duplication, which need to be corrected to maintain data integrity. In this paper, we provide error-correcting codes for errors caused by tandem duplications, which create a copy of a block of the sequence and insert it in a tandem manner, i.e., next to the original. In particular, we present two families of codes for correcting errors due to tandem-duplications of a fixed length, the first family can correct any number of errors while the second corrects a bounded number of errors. We also study codes for correcting tandem duplications of length up to a given constant $k$, where we are primarily focused on the cases of $k=2,3$. Finally, we provide a full classification of the sets of lengths allowed in tandem duplication that result in a unique root for all sequences.

cs.IT↗
arXiv2015

Paradoxical Quantum Scattering off a Time Dependent Potential?

We consider the quantum scattering off a time dependent barrier in one dimension. Our initial state is a right going eigenstate of the Hamiltonian at time t=0. It consists of a plane wave incoming from the left, a reflected plane wave on the left of the barrier and a transmitted wave on its right. We find that at later times, the evolving wave function has a finite overlap with left going eigenstates of the Hamiltonian at time t=0. For simplicity we present an exact result for a time dependent delta function potential. Then we show that our result is not an artifact of that specific choice of the potential. This surprising result does not agree with our interpretation of the eigenstates of the Hamiltonian at time t=0. A numerical study of evolving wave packets, does not find any corresponding real effect. Namely, we do not see on the right hand side of the barrier any evidence for a left going packet. Our conclusion is thus that the intriguing result mentioned above is intriguing only due to the semantics of the interpretation.

quant-ph↗
arXiv2015

File Updates Under Random/Arbitrary Insertions And Deletions

A client/encoder edits a file, as modeled by an insertion-deletion (InDel) process. An old copy of the file is stored remotely at a data-centre/decoder, and is also available to the client. We consider the problem of throughput- and computationally-efficient communication from the client to the data-centre, to enable the server to update its copy to the newly edited file. We study two models for the source files/edit patterns: the random pre-edit sequence left-to-right random InDel (RPES-LtRRID) process, and the arbitrary pre-edit sequence arbitrary InDel (APES-AID) process. In both models, we consider the regime in which the number of insertions/deletions is a small (but constant) fraction of the original file. For both models we prove information-theoretic lower bounds on the best possible compression rates that enable file updates. Conversely, our compression algorithms use dynamic programming (DP) and entropy coding, and achieve rates that are approximately optimal.

cs.IT↗
arXiv2015

Unusual Transitions Made Possible by Superoscillations

We present a physical scenario in which an electromagnetic field in a state consisted of photons whose energies are smaller than the energy gap of a two-state particle, interacts with the particle, for an arbitrarily long duration, as if it was consisted of photons whose energy matches the energy gap of the particle. This type of interaction is possible when the field is in a specially tailored state whose magnetic field's expectation value is a superoscillatory function.

quant-ph↗
arXiv2015

Semi-constrained Systems

When transmitting information over a noisy channel, two approaches, dating back to Shannon's work, are common: assuming the channel errors are independent of the transmitted content and devising an error-correcting code, or assuming the errors are data dependent and devising a constrained-coding scheme that eliminates all offending data patterns. In this paper we analyze a middle road, which we call a semiconstrained system. In such a system, which is an extension of the channel with cost constraints model, we do not eliminate the error-causing sequences entirely, but rather restrict the frequency in which they appear. We address several key issues in this study. The first is proving closed-form bounds on the capacity which allow us to bound the asymptotics of the capacity. In particular, we bound the rate at which the capacity of the semiconstrained $(0,k)$-RLL tends to $1$ as $k$ grows. The second key issue is devising efficient encoding and decoding procedures that asymptotically achieve capacity with vanishing error. Finally, we consider delicate issues involving the continuity of the capacity and a relaxation of the definition of semiconstrained systems.

cs.IT↗
arXiv2014

Quasi-linear Network Coding

We present a heuristic for designing vector non-linear network codes for non-multicast networks, which we call quasi-linear network codes. The method presented has two phases: finding an approximate linear network code over the reals, and then quantizing it to a vector non-linear network code using a fixed-point representation. Apart from describing the method, we draw some links between some network parameters and the rate of the resulting code.

cs.IT↗