arXiv subjects

Moshe Schwartz

Publications and source records attributed to Moshe Schwartz.

At least 55 records · Page 3Linked to original sources

arXiv2020

On Lattice Packings and Coverings of Asymmetric Limited-Magnitude Balls

We construct integer error-correcting codes and covering codes for the limited-magnitude error channel with more than one error. The codes are lattices that pack or cover the space with the appropriate error ball. Some of the constructions attain an asymptotic packing/covering density that is constant. The results are obtained via various methods, including the use of codes in the Hamming metric, modular $B_t$-sequences, $2$-fold Sidon sets, and sets avoiding arithmetic progression.

cs.IT↗

arXiv2020

Coding for Optimized Writing Rate in DNA Storage

A method for encoding information in DNA sequences is described. The method is based on the precision-resolution framework, and is aimed to work in conjunction with a recently suggested terminator-free template independent DNA synthesis method. The suggested method optimizes the amount of information bits per synthesis time unit, namely, the writing rate. Additionally, the encoding scheme studied here takes into account the existence of multiple copies of the DNA sequence, which are independently distorted. Finally, quantizers for various run-length distributions are designed.

cs.IT↗

arXiv2020

On the Gap between Scalar and Vector Solutions of Generalized Combination Networks

We study scalar-linear and vector-linear solutions to the generalized combination network. We derive new upper and lower bounds on the maximum number of nodes in the middle layer, depending on the network parameters. These bounds improve and extend the parameter range of known bounds. Using these new bounds we present a general lower bound on the gap in the alphabet size between scalar-linear and vector-linear solutions.

cs.IT↗

arXiv2020

On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes

Optimal locally repairable codes with information locality are considered. Optimal codes are constructed, whose length is also order-optimal with respect to a new bound on the code length derived in this paper. The length of the constructed codes is super-linear in the alphabet size, which improves upon the well known pyramid codes, whose length is only linear in the alphabet size. The recoverable erasure patterns are also analyzed for the new codes. Based on the recoverable erasure patterns, we construct generalized sector-disk (GSD) codes, which can recover from disk erasures mixed with sector erasures in a more general setting than known sector-disk (SD) codes. Additionally, the number of sectors in the constructed GSD codes is super-linear in the alphabet size, compared with known SD codes, whose number of sectors is only linear in the alphabet size.

cs.IT↗

arXiv2019

Fake Superoscillations

We construct a signal from "almost" pure oscillations within some low frequency band. We construct it to produce a superoscillation with frequency above the nominal band limit. We find that indeed the required high frequency is produced but the signal is not a superoscillation as the high frequency components are real and result from an intriguing interference in the frequency domain of the tails of Gaussians concentrated around points within the nominal frequency band.

quant-ph↗

arXiv2019

Hierarchical Erasure Correction of Linear Codes

Linear codes over finite extension fields have widespread applications in theory and practice. In some scenarios, the decoder has a sequential access to the codeword symbols, giving rise to a hierarchical erasure structure. In this paper we develop a mathematical framework for hierarchical erasures over extension fields, provide several bounds and constructions, and discuss potential applications in distributed storage and flash memories. Our results show intimate connection to Universally Decodable Matrices, as well as to Reed-Solomon and Gabidulin codes.

cs.IT↗

arXiv2019

Network-Coding Solutions for Minimal Combination Networks and Their Sub-networks

Minimal multicast networks are fascinating and efficient combinatorial objects, where the removal of a single link makes it impossible for all receivers to obtain all messages. We study the structure of such networks, and prove some constraints on their possible solutions. We then focus on the combination network, which is one of the simplest and most insightful network in network-coding theory. Of particular interest are minimal combination networks. We study the gap in alphabet size between vector-linear and scalar-linear network-coding solutions for such minimal combination networks and some of their sub-networks. For minimal multicast networks with two source messages we find the maximum possible gap. We define and study sub-networks of the combination network, which we call Kneser networks, and prove that they attain the upper bound on the gap with equality. We also prove that the study of this gap may be limited to the study of sub-networks of minimal combination networks, by using graph homomorphisms connected with the $q$-analog of Kneser graphs. Additionally, we prove a gap for minimal multicast networks with three or more source messages by studying Kneser networks. Finally, an upper bound on the gap for full minimal combination networks shows nearly no gap, or none in some cases. This is obtained using an MDS-like bound for subspaces over a finite field.

cs.IT↗

arXiv2019

Reconstruction Codes for DNA Sequences with Uniform Tandem-Duplication Errors

DNA as a data storage medium has several advantages, including far greater data density compared to electronic media. We propose that schemes for data storage in the DNA of living organisms may benefit from studying the reconstruction problem, which is applicable whenever multiple reads of noisy data are available. This strategy is uniquely suited to the medium, which inherently replicates stored data in multiple distinct ways, caused by mutations. We consider noise introduced solely by uniform tandem-duplication, and utilize the relation to constant-weight integer codes in the Manhattan metric. By bounding the intersection of the cross-polytope with hyperplanes, we prove the existence of reconstruction codes with greater capacity than known error-correcting codes, which we can determine analytically for any set of parameters.

cs.IT↗

arXiv2019

On Optimal Locally Repairable Codes with Super-Linear Length

Locally repairable codes which are optimal with respect to the bound presented by Prakash et al. are considered. New upper bounds on the length of such optimal codes are derived. The new bounds both improve and generalize previously known bounds. Optimal codes are constructed, whose length is order-optimal when compared with the new upper bounds. The length of the codes is super-linear in the alphabet size.

cs.IT↗

arXiv2019

Random Close Packing and the Hard Sphere Percus-Yevick Theory

The Percus-Yevick theory for monodisperse hard spheres gives very good results for the pressure and structure factor of the system in a whole range of densities that lie within the liquid phase. However, the equation seems to lead to a very unacceptable result beyond that region. Namely, the Percus-Yevick theory predicts a smooth behavior of the pressure that diverges only when the volume fraction $η$ approaches unity. Thus, within the theory there seems to be no indication for the termination of the liquid phase and the transition to a solid or to a glass. In the present article we study the Percus-Yevick hard sphere pair distribution function, $g_2(r)$, for various spatial dimensions. We find that beyond a certain critical volume fraction $η_c$, the pair distribution function, $g_2(r)$, which should be positive definite, becomes negative at some distances. We also present an intriguing observation that the critical $η_c$ values we find are consistent with volume fractions where onsets of random close packing (or maximally random jammed states) are reported in the literature for various dimensions. That observation is supported by an intuitive argument. This work may have important implications for other systems for which a Percus-Yevick theory exists.

cond-mat.stat-mech↗

arXiv2019

On the Access Complexity of PIR Schemes

Private information retrieval has been reformulated in an information-theoretic perspective in recent years. The two most important parameters considered for a PIR scheme in a distributed storage system are the storage overhead and PIR rate. The complexity of the computations done by the servers for the various tasks of the distributed storage system is an important parameter in such systems which didn't get enough attention in PIR schemes. As a consequence, we take into consideration a third parameter, the access complexity of a PIR scheme, which characterizes the total amount of data to be accessed by the servers for responding to the queries throughout a PIR scheme. We use a general covering codes approach as the main tool for improving the access complexity. With a given amount of storage overhead, the ultimate objective is to characterize the tradeoff between the rate and access complexity of a PIR scheme. This covering codes approach raises a new interesting coding problem of generalized coverings similarly to the well-known generalized Hamming weights.

cs.IT↗

arXiv2018

Evolution of $k$-mer Frequencies and Entropy in Duplication and Substitution Mutation Systems

Genomic evolution can be viewed as string-editing processes driven by mutations. An understanding of the statistical properties resulting from these mutation processes is of value in a variety of tasks related to biological sequence data, e.g., estimation of model parameters and compression. At the same time, due to the complexity of these processes, designing tractable stochastic models and analyzing them are challenging. In this paper, we study two kinds of systems, each representing a set of mutations. In the first system, tandem duplications and substitution mutations are allowed and in the other, interspersed duplications. We provide stochastic models and, via stochastic approximation, study the evolution of substring frequencies for these two systems separately. Specifically, we show that $k$-mer frequencies converge almost surely and determine the limit set. Furthermore, we present a method for finding upper bounds on entropy for such systems.

cs.IT↗

arXiv2018

An Efficient Shift Rule for the Prefer-Max De Bruijn Sequence

A shift rule for the prefer-max De Bruijn sequence is formulated, for all sequence orders, and over any finite alphabet. An efficient algorithm for this shift rule is presented, which has linear (in the sequence order) time and memory complexity.

cs.DM↗

arXiv2018

The Capacity of Some Pólya String Models

We study random string-duplication systems, which we call Pólya string models. These are motivated by DNA storage in living organisms, and certain random mutation processes that affect their genome. Unlike previous works that study the combinatorial capacity of string-duplication systems, or various string statistics, this work provides exact capacity or bounds on it, for several probabilistic models. In particular, we study the capacity of noisy string-duplication systems, including the tandem-duplication, end-duplication, and interspersed-duplication systems. Interesting connections are drawn between some systems and the signature of random permutations, as well as to the beta distribution common in population genetics.

cs.IT↗

arXiv2018

Study of potential Hamiltonians for quantum graphity

In this work we show that the simple Hamiltonians used in Quantum Graphity models are highly degenerate, having multiple ground states that are not lattices. In order to assess the distance of the resulting graphs from a lattice graph, we propose a new measure of the equivalence of vertices in the graph. We then propose a Hamiltonian that has a rectangular lattice as a ground state that appears to be non-degenerate. The resulting graphs are close to being a rectangular lattice, and the defects from the perfect lattice seem to behave like particles of quantized mass that attract one another.

cond-mat.stat-mech↗

arXiv2018

Stress - Strain Rate Relation in Plug-Free Flow of Dense Granular Matter

We derive the macroscopic stress tensor for plug-free dense granular flow, using a first-principles coarse-graining of the inter-granular forces. The derivation is based on the assumption, which defines the da Vinci Fluid model, that the inter-granular interactions are dominated by normal contact forces and solid friction. An explicit form for the stress -- strain rate relation is obtained, providing closure for the flow equations of dense granular fluids and improves on existing models, which are also based on solid friction as the dominant drag mechanism.

cond-mat.stat-mech↗

arXiv2018

Locality and Availability of Array Codes Constructed from Subspaces

Ever-increasing amounts of data are created and processed in internet-scale companies such as Google, Facebook, and Amazon. The efficient storage of such copious amounts of data has thus become a fundamental and acute problem in modern computing. No single machine can possibly satisfy such immense storage demands. Therefore, distributed storage systems (DSS), which rely on tens of thousands of storage nodes, are the only viable solution. Such systems are broadly used in all modern internet-scale systems. However, the design of a DSS poses a number of crucial challenges, markedly different from single-user storage systems. Such systems must be able to reconstruct the data efficiently, to overcome failure of servers, to correct errors, etc. Lots of research was done in the last few years to answer these challenges and the research is increasing in parallel to the increasing amount of stored data. The main goal of this paper is to consider codes which have two of the most important features of distributed storage systems, namely, locality and availability. Our codes are array codes which are based on subspaces of a linear space over a finite field. We present several constructions of such codes which are $q$-analog to some of the known block codes. Some of these codes possess independent intellectual merit. We examine the locality and availability of the constructed codes. In particular we distinguish between two types of locality and availability, node vs.~symbol, locality and availability. To our knowledge this is the first time that such a distinction is given in the literature.

cs.IT↗

arXiv2018

Granular Fluids with Solid Friction and Heating

We perform large-scale molecular dynamics simulations to study heated granular fluids in three dimensions. Granular particles dissipate their kinetic energy due to solid frictional interaction with other particles. The velocity of each particle is perturbed by a uniformly-distributed random noise, which mimics the heating. At the early stage of evolution, the kinetic energy of the system decays with time and reaches a steady state at a later stage. The velocity distribution in the steady state shows a non-Gaussian distribution. This has been characterized by using the Sonine polynomial expansion for a wide range of densities. Particles show diffusive motion for densities below the jamming density $ϕ_{\rm J}$

cond-mat.stat-mech↗