Optimal Linear Codes with a Local-Error-Correction Property

Motivated by applications to distributed storage, Gopalan et al recently introduced the interesting notion of information-symbol locality in a linear code. By this it is meant that each message symbol appears in a parity-check equation associated with small Hamming weight, thereby enabling recovery of the message symbol by examining a small number of other code symbols. This notion is expanded to the case when all code symbols, not just the message symbols, are covered by such ``local'' parity. In this paper, we extend the results of Gopalan et. al. so as to permit recovery of an erased code symbol even in the presence of errors in local parity symbols. We present tight bounds on the minimum distance of such codes and exhibit codes that are optimal with respect to the local error-correction property. As a corollary, we obtain an upper bound on the minimum distance of a concatenated code.

EXIT Chart Based Design of Irregular LDPC Codes for Large-MIMO Systems

In this letter, we characterize the extrinsic information transfer (EXIT) behavior of a factor graph based message passing algorithm for detection in large multiple-input multiple-output (MIMO) systems with tens to hundreds of antennas. The EXIT curves of a joint detection-decoding receiver are obtained for low density parity check (LDPC) codes of given degree distributions. From the obtained EXIT curves, an optimization of the LDPC code degree profiles is carried out to design irregular LDPC codes matched to the large-MIMO channel and joint message passing receiver. With low complexity joint detection-decoding, these codes are shown to perform better than off-the-shelf irregular codes in the literature by about 1 to 1.5 dB at a coded BER of 10(-5) in 16 x 16, 64 x 64 and 256 x 256 MIMO systems.

Information-theoretically secure regenerating codes for distributed storage

Regenerating codes are a class of codes for distributed storage networks that provide reliability and availability of data, and also perform efficient node repair. Another important aspect of a distributed storage network is its security. In this paper, we consider a threat model where an eavesdropper may gain access to the data stored in a subset of the storage nodes, and possibly also, to the data downloaded during repair of some nodes. We provide explicit constructions of regenerating codes that achieve information-theoretic secrecy capacity in this setting.

W/T SPR codes offer higher throughput in OCDMA networks

In this paper optical code-division multiple-access (O-CDMA) packet network is considered, which offers inherent security in the access networks. Two types of random access protocols are proposed for packet transmission. In protocol 1, all distinct codes and in protocol 2, distinct codes as well as shifted versions of all these codes are used. O-CDMA network performance using optical orthogonal codes (OOCs) 1-D and two-dimensional (2-D) wavelength/time single-pulse-per-row (W/T SPR) codes are analyzed. The main advantage of using 2-D codes instead of one-dimensional (1-D) codes is to reduce the errors due to multiple access interference among different users. SPR codes are chosen as they have nearly ideal correlation properties. In this paper, correlation receiver is considered in the analysis. Using analytical model, we compare the OOC and SPR code performances in O-CDMA networks. We compute packet-success probability and throughput for both the types of codes. The analysis shows improved performance with SPR codes as compared to OOC codes.

A nested linear codes approach to distributed function computation over subspaces

In this paper, we consider a distributed function computation setting, where there are m distributed but correlated sources X1,...,Xm and a receiver interested in computing an s-dimensional subspace generated by [X1,...,Xm]Γ for some (m × s) matrix Γ of rank s. We construct a scheme based on nested linear codes and characterize the achievable rates obtained using the scheme. The proposed nested-linear-code approach performs at least as well as the Slepian-Wolf scheme in terms of sum-rate performance for all subspaces and source distributions. In addition, for a large class of distributions and subspaces, the scheme improves upon the Slepian-Wolf approach. The nested-linear-code scheme may be viewed as uniting under a common framework, both the Korner-Marton approach of using a common linear encoder as well as the Slepian-Wolf approach of employing different encoders at each source. Along the way, we prove an interesting and fundamental structural result on the nature of subspaces of an m-dimensional vector space V with respect to a normalized measure of entropy. Here, each element in V corresponds to a distinct linear combination of a set {Xi}im=1 of m random variables whose joint probability distribution function is given.

Queueing delay - error probability tradeoff for point-to-point channels with fixed length block codes

We study the tradeoff between the average error probability and the average queueing delay of messages which randomly arrive to the transmitter of a point-to-point discrete memoryless channel that uses variable rate fixed codeword length random coding. Bounds to the exponential decay rate of the average error probability with average queueing delay in the regime of large average delay are obtained. Upper and lower bounds to the optimal average delay for a given average error probability constraint are presented. We then formulate a constrained Markov decision problem for characterizing the rate of transmission as a function of queue size given an average error probability constraint. Using a Lagrange multiplier the constrained Markov decision problem is then converted to a problem of minimizing the average cost for a Markov decision problem. A simple heuristic policy is proposed which approximately achieves the optimal average cost.

On the treewidth of MDS and Reed-Muller codes

The treewidth of a linear code is the least constraint complexity of any of its cycle-free graphical realizations. This notion provides a useful parametrization of the maximum-likelihood decoding complexity for linear codes. In this paper, we compute exact expressions for the treewidth of maximum distance separable codes, and first- and second-order Reed-Muller codes. These results constitute the only known explicit expressions for the treewidth of algebraic codes.

Network-error correcting codes using small fields

Recently, Ebrahimi and Fragouli proposed an algorithm to construct scalar network codes using small fields (and vector network codes of small lengths) satisfying multicast constraints in a given single-source, acyclic network. The contribution of this paper is two fold. Primarily, we extend the scalar network coding algorithm of Ebrahimi and Fragouli (henceforth referred to as the EF algorithm) to block network-error correction. Existing construction algorithms of block network-error correcting codes require a rather large field size, which grows with the size of the network and the number of sinks, and thereby can be prohibitive in large networks. We give an algorithm which, starting from a given network-error correcting code, can obtain another network code using a small field, with the same error correcting capability as the original code. Our secondary contribution is to improve the EF Algorithm itself. The major step in the EF algorithm is to find a least degree irreducible polynomial which is coprime to another large degree polynomial. We suggest an alternate method to compute this coprime polynomial, which is faster than the brute force method in the work of Ebrahimi and Fragouli.

A cyclic peptide mimic of an RNA recognition motif of human La protein is a potent inhibitor of hepatitis C virus

Due to limited available therapeutic options, developing new lead compounds against hepatitis C virus is an urgent need. Human La protein stimulates hepatitis C virus translation through interaction with the hepatitis C viral RNA. A cyclic peptide mimicking the beta-turn of the human La protein that interacts with the viral RNA was synthesized. It inhibits hepatitis C viral RNA translation significantly better than the corresponding linear peptide at longer post-treatment times. The cyclic peptide also inhibited replication as measured by replicon RNA levels using real time RT-PCR. The cyclic peptide emerges as a promising lead compound against hepatitis C.

Performance improvement of short-length regular low-density parity-check codes with low-complexity post-processing

It is well known that extremely long low-density parity-check (LDPC) codes perform exceptionally well for error correction applications, short-length codes are preferable in practical applications. However, short-length LDPC codes suffer from performance degradation owing to graph-based impairments such as short cycles, trapping sets and stopping sets and so on in the bipartite graph of the LDPC matrix. In particular, performance degradation at moderate to high E-b/N-0 is caused by the oscillations in bit node a posteriori probabilities induced by short cycles and trapping sets in bipartite graphs. In this study, a computationally efficient algorithm is proposed to improve the performance of short-length LDPC codes at moderate to high E-b/N-0. This algorithm makes use of the information generated by the belief propagation (BP) algorithm in previous iterations before a decoding failure occurs. Using this information, a reliability-based estimation is performed on each bit node to supplement the BP algorithm. The proposed algorithm gives an appreciable coding gain as compared with BP decoding for LDPC codes of a code rate equal to or less than 1/2 rate coding. The coding gains are modest to significant in the case of optimised (for bipartite graph conditioning) regular LDPC codes, whereas the coding gains are huge in the case of unoptimised codes. Hence, this algorithm is useful for relaxing some stringent constraints on the graphical structure of the LDPC code and for developing hardware-friendly designs.

The precision with which single cells of Dictyostelium discoideum can locate a source of cyclic AMP

When stimulated by a point source of cyclic AMP, a starved amoeba of Dictyostelium discoideum responds by putting out a hollow balloon-like membrane extension followed by a pseudopod. The effect of the stimulus is to influence the position where either of these protrusions is made on the cell rather than to cause them to be made. Because the pseudopod forms perpendicular to the cell surface, its location is a measure of the precision with which the cell can locate the cAMP source. Cells beyond 1 h of starvation respond non-randomly with a precision that improves steadily thereafter. A cell that is starved for 1-2 h can locate the source accurately 43% of the time; and if starved for 6-7 h, 87% of the time. The response always has a high scatter; population-level heterogeneity reflects stochasticity in single cell behaviour. From the angular distribution of the response its maximum information content is estimated to be 2-3 bits. In summary, we quantitatively demonstrate the stochastic nature of the directional response and the increase in its accuracy over time.

Cyclic AMP-dependent protein lysine acylation in mycobacteria regulates fatty acid and propionate metabolism

Acetylation of lysine residues is a posttranslational modification that is used by both eukaryotes and prokaryotes to regulate a variety of biological processes. Here we identify multiple substrates for the cAMP-dependent protein lysine acetyltransferase from Mycobacterium tuberculosis (KATmt). We demonstrate that a catalytically important lysine residue in a number of FadD (fatty acyl CoA synthetase) enzymes is acetylated by KATmt in a cAMP-dependent manner and that acetylation inhibits the activity of FadD enzymes. A sirtuin-like enzyme can deacetylate multiple FadDs, thus completing the regulatory cycle. Using a strain deleted for the KATmt ortholog in Mycobacterium bovis Bacillus Calmette-Guerin (BCG), we show for the first time that acetylation is dependent on intracellular cAMP levels. KATmt can utilize propionyl CoA as a substrate and, therefore, plays a critical role in alleviating propionyl CoA toxicity in mycobacteria by inactivating acyl CoA synthetase (ACS). The precision by which mycobacteria can regulate the metabolism of fatty acids in a cAMP-dependent manner appears to be unparalleled in other biological organisms and is ideally suited to adapt to the complex environment that pathogenic mycobacteria experience in the host.

Cyclic nucleotide signaling in intestinal epithelia: getting to the gut of the matter

The intestine is the primary site of nutrient absorption, fluid-ion secretion, and home to trillions of symbiotic microbiota. The high turnover of the intestinal epithelia also renders it susceptible to neoplastic growth. These diverse processes are carefully regulated by an intricate signaling network. Among the myriad molecules involved in intestinal epithelial cell homeostasis are the second messengers, cyclic AMP (cAMP) and cyclic GMP (cGMP). These cyclic nucleotides are synthesized by nucleotidyl cyclases whose activities are regulated by extrinsic and intrinsic cues. Downstream effectors of cAMP and cGMP include protein kinases, cyclic nucleotide gated ion channels, and transcription factors, which modulate key processes such as ion-balance, immune response, and cell proliferation. The web of interaction involving the major signaling pathways of cAMP and cGMP in the intestinal epithelial cell, and possible cross-talk among the pathways, are highlighted in this review. Deregulation of these pathways occurs during infection by pathogens, intestinal inflammation, and cancer. Thus, an appreciation of the importance of cyclic nucleotide signaling in the intestine furthers our understanding of bowel disease, thereby aiding in the development of therapeutic approaches.

Codes with local regeneration

Regenerating codes and codes with locality are schemes recently proposed for a distributed storage network. While regenerating codes minimize the data downloaded for node repair, codes with locality minimize the number of nodes accessed during repair. In this paper, we provide some constructions of codes with locality, in which the local codes are regenerating codes, thereby combining the advantages of both classes of codes. The proposed constructions achieve an upper bound on minimum distance and are hence optimal. The constructions include both the cases when the local regenerating codes correspond to the MSR point as well as the MBR point on the storage repair-bandwidth tradeoff curve.

Cyclic AMP in Mycobacteria: the second messenger comes first

Cyclic AMP (cAMP) has emerged as a pivotal molecule for signalling in all life forms. Mycobacterial genomes have been found to encode for numerous proteins that are involved in cAMP generation, degradation and utilization. Many of these proteins have domain organizations unique to mycobacteria. This review summarizes recent advances in mechanisms of cAMP synthesis and degradation, focusing on the processes by which cAMP modulates mycobacterial signalling. We explore its impact on the physiology of the organism and on the discourse between M. tuberculosis and its host.