Decoherence in a system of many two--level atoms

I show that the decoherence in a system of $N$ degenerate two--level atoms interacting with a bosonic heat bath is for any number of atoms $N$ governed by a generalized Hamming distance (called ``decoherence metric'') between the superposed quantum states, with a time--dependent metric tensor that is specific for the heat bath.The decoherence metric allows for the complete characterization of the decoherence of all possible superpositions of many-particle states, and can be applied to minimize the over-all decoherence in a quantum memory. For qubits which are far apart, the decoherence is given by a function describing single-qubit decoherence times the standard Hamming distance. I apply the theory to cold atoms in an optical lattice interacting with black body radiation.Comment: replaced with published versio

Hamming distance and mobility behavior in generalized rock-paper-scissors models

This work reports on two related investigations of stochastic simulations which are widely used to study biodiversity and other related issues. We first deal with the behavior of the Hamming distance under the increase of the number of species and the size of the lattice, and then investigate how the mobility of the species contributes to jeopardize biodiversity. The investigations are based on the standard rules of reproduction, mobility and predation or competition, which are described by specific rules, guided by generalization of the rock-paper-scissors game, valid in the case of three species. The results on the Hamming distance indicate that it engenders universal behavior, independently of the number of species and the size of the square lattice. The results on the mobility confirm the prediction that it may destroy diversity, if it is increased to higher and higher values.Comment: 7 pages, 9 figures. To appear in EP

Binary Message Passing Decoding of Product Codes Based on Generalized Minimum Distance Decoding

We propose a binary message passing decoding algorithm for product codes based on generalized minimum distance decoding (GMDD) of the component codes, where the last stage of the GMDD makes a decision based on the Hamming distance metric. The proposed algorithm closes half of the gap between conventional iterative bounded distance decoding (iBDD) and turbo product decoding based on the Chase--Pyndiah algorithm, at the expense of some increase in complexity. Furthermore, the proposed algorithm entails only a limited increase in data flow compared to iBDD.Comment: Invited paper to the 53rd Annual Conference on Information Sciences and Systems (CISS), Baltimore, MD, March 2019. arXiv admin note: text overlap with arXiv:1806.1090

Codes with Locality for Two Erasures

In this paper, we study codes with locality that can recover from two erasures via a sequence of two local, parity-check computations. By a local parity-check computation, we mean recovery via a single parity-check equation associated to small Hamming weight. Earlier approaches considered recovery in parallel; the sequential approach allows us to potentially construct codes with improved minimum distance. These codes, which we refer to as locally 2-reconstructible codes, are a natural generalization along one direction, of codes with all-symbol locality introduced by Gopalan \textit{et al}, in which recovery from a single erasure is considered. By studying the Generalized Hamming Weights of the dual code, we derive upper bounds on the minimum distance of locally 2-reconstructible codes and provide constructions for a family of codes based on Tur\'an graphs, that are optimal with respect to this bound. The minimum distance bound derived here is universal in the sense that no code which permits all-symbol local recovery from $2$ erasures can have larger minimum distance regardless of approach adopted. Our approach also leads to a new bound on the minimum distance of codes with all-symbol locality for the single-erasure case.Comment: 14 pages, 3 figures, Updated for improved readabilit