Codes for Graph Erasures

Motivated by systems where the information is represented by a graph, such as neural networks, associative memories, and distributed systems, we present in this work a new class of codes, called codes over graphs. Under this paradigm, the information is stored on the edges of an undirected graph, and a code over graphs is a set of graphs. A node failure is the event where all edges in the neighborhood of the failed node have been erased. We say that a code over graphs can tolerate $\rho$ node failures if it can correct the erased edges of any $\rho$ failed nodes in the graph. While the construction of such codes can be easily accomplished by MDS codes, their field size has to be at least $O(n^2)$, when $n$ is the number of nodes in the graph. In this work we present several constructions of codes over graphs with smaller field size. In particular, we present optimal codes over graphs correcting two node failures over the binary field, when the number of nodes in the graph is a prime number. We also present a construction of codes over graphs correcting $\rho$ node failures for all $\rho$ over a field of size at least $(n+1)/2-1$, and show how to improve this construction for optimal codes when $\rho=2,3$.Comment: To appear in IEEE International Symposium on Information Theor

Optimal Linear and Cyclic Locally Repairable Codes over Small Fields

We consider locally repairable codes over small fields and propose constructions of optimal cyclic and linear codes in terms of the dimension for a given distance and length. Four new constructions of optimal linear codes over small fields with locality properties are developed. The first two approaches give binary cyclic codes with locality two. While the first construction has availability one, the second binary code is characterized by multiple available repair sets based on a binary Simplex code. The third approach extends the first one to q-ary cyclic codes including (binary) extension fields, where the locality property is determined by the properties of a shortened first-order Reed-Muller code. Non-cyclic optimal binary linear codes with locality greater than two are obtained by the fourth construction.Comment: IEEE Information Theory Workshop (ITW) 2015, Apr 2015, Jerusalem, Israe

Critical Thresholds in 2D Restricted Euler-Poisson Equations

We provide a complete description of the critical threshold phenomena for the two-dimensional localized Euler-Poisson equations, introduced by the authors in [Liu & Tadmor, Comm. Math Phys., To appear]. Here, the questions of global regularity vs. finite-time breakdown for the 2D Restricted Euler-Poisson solutions are classified in terms of precise explicit formulae, describing a remarkable variety of critical threshold surfaces of initial configurations. In particular, it is shown that the 2D critical thresholds depend on the relative size of three quantities: the initial density, the initial divergence as well as the initial spectral gap, that is, the difference between the two eigenvalues of the $2 \times 2$ initial velocity gradient

Convenient total variation diminishing conditions for nonlinear difference schemes

Convenient conditions for nonlinear difference schemes to be total-variation diminishing (TVD) are reviewed. It is shown that such schemes share the TVD property, provided their numerical fluxes meet a certain positivity condition at extrema values but can be arbitrary otherwise. The conditions are invariant under different incremental representations of the nonlinear schemes, and thus provide a simplified generalization of the TVD conditions due to Harten and others