The Treewidth of MDS and Reed-Muller Codes

The constraint complexity of a graphical realization of a linear code is the maximum dimension of the local constraint codes in the realization. The treewidth of a linear code is the least constraint complexity of any of its cycle-free graphical realizations. This notion provides a useful parameterization of the maximum-likelihood decoding complexity for linear codes. In this paper, we show the surprising fact that for maximum distance separable codes and Reed-Muller codes, treewidth equals trelliswidth, which, for a code, is defined to be the least constraint complexity (or branch complexity) of any of its trellis realizations. From this, we obtain exact expressions for the treewidth of these codes, which constitute the only known explicit expressions for the treewidth of algebraic codes.

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.

Synthetic Triterpenoid Cyano Enone of Methyl Boswellate Activates Intrinsic, Extrinsic, and Endoplasmic Reticulum Stress Cell Death Pathways in Tumor Cell Lines

We explored the effect of a novel synthetic triterpenoid compound cyano enone of methyl boswellates (CEMB) on various prostate cancer and glioma cancer cell lines. CEMB displayed concentration-dependent cytotoxic activity with submicromolar lethal dose 50% (LD(50)) values in 10 of 10 tumor cell lines tested. CEMB-induced cytotoxicity is accompanied by activation of downstream effector caspases (caspases 3 and 7) and by upstream initiator caspases involved in both the extrinsic (caspase 8) and intrinsic (caspase 9) apoptotic pathways. By using short interfering RNAs (siRNA), we show evidence that knockdown of caspase 8, DR4, Apaf-1, and Bid impairs CEMB-induced cell death. Similar to other proapoptotic synthetic triterpenoid compounds, CEMB-induced apoptosis involved endoplasmic reticulum stress, as shown by partial rescue of tumor cells by siRNA-mediated knockdown of expression of genes involved in the unfolded protein response such as IRE1 alpha, PERK, and ATF6. Altogether, our results suggest that CEMB stimulates several apoptotic pathways in cancer cells, suggesting that this compound should be evaluated further as a potential agent for cancer therapy. Mol Cancer Ther; 10(9); 1635-43. (C)2011 AACR.

A note on acyclic edge coloring of complete bipartite graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic (2-colored) cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). Let Delta = Delta(G) denote the maximum degree of a vertex in a graph G. A complete bipartite graph with n vertices on each side is denoted by K-n,K-n. Alon, McDiarmid and Reed observed that a'(K-p-1,K-p-1) = p for every prime p. In this paper we prove that a'(K-p,K-p) <= p + 2 = Delta + 2 when p is prime. Basavaraju, Chandran and Kummini proved that a'(K-n,K-n) >= n + 2 = Delta + 2 when n is odd, which combined with our result implies that a'(K-p,K-p) = p + 2 = Delta + 2 when p is an odd prime. Moreover we show that if we remove any edge from K-p,K-p, the resulting graph is acyclically Delta + 1 = p + 1-edge-colorable. (C) 2009 Elsevier B.V. All rights reserved.

A simple vibrating reed apparatus for use at low temperatures

The authors report the design and construction of a very simple vibrating reed apparatus with automatic frequency locking capability where the resonance frequency and the internal friction can be recorded continuously as a function of temperature. The apparatus is particularly suitable for studies down to liquid helium temperatures or below.

Reed-Muller Canonical Forms in Multivalued Logic

Canonical forms for m-valued functions referred to as m-Reed-Muller canonical (m-RMC) forms that are a generalization of RMC forms of two-valued functions are proposed. m-RMC forms are based on the operations ?m (addition mod m) and .m (multiplication mod m) and do not, as in the cases of the generalizations proposed in the literature, require an m-valued function for m not a power of a prime, to be expressed by a canonical form for M-valued functions, where M > m is a power of a prime. Methods of obtaining the m-RMC forms from the truth vector or the sum of products representation of an m-valued function are discussed. Using a generalization of the Boolean difference to m-valued logic, series expansions for m-valued functions are derived.

A Note on Minimal Reed-Muller Canonical Forms of Switching Functions

A nonexhaustive procedure for obtaining minimal Reed-Muller canonical (RMC) forms of switching functions is presented. This procedure is a modification of a procedure presented earlier in the literature and enables derivation of an upper bound on the number of RMC forms to be derived to choose a minimal one. It is shown that the task of obtaining minimal RMC forms is simplified in the case of symmetric functions and self-dual functions.

On Generalized Reed-Muller Expansions

The generalized Reed-Muller expansions of a switching function are generated using a single Boolean matrix and step-by-step shifting of the principal column.

Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff

Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-Solomon codes, permit data recovery from any subset of k nodes within the n-node network. However, regenerating codes possess in addition, the ability to repair a failed node by connecting to an arbitrary subset of d nodes. It has been shown that for the case of functional repair, there is a tradeoff between the amount of data stored per node and the bandwidth required to repair a failed node. A special case of functional repair is exact repair where the replacement node is required to store data identical to that in the failed node. Exact repair is of interest as it greatly simplifies system implementation. The first result of this paper is an explicit, exact-repair code for the point on the storage-bandwidth tradeoff corresponding to the minimum possible repair bandwidth, for the case when d = n-1. This code has a particularly simple graphical description, and most interestingly has the ability to carry out exact repair without any need to perform arithmetic operations. We term this ability of the code to perform repair through mere transfer of data as repair by transfer. The second result of this paper shows that the interior points on the storage-bandwidth tradeoff cannot be achieved under exact repair, thus pointing to the existence of a separate tradeoff under exact repair. Specifically, we identify a set of scenarios which we term as ``helper node pooling,'' and show that it is the necessity to satisfy such scenarios that overconstrains the system.

Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions

Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-Solomon codes, permit data recovery from any arbitrary of nodes. However regenerating codes possess in addition, the ability to repair a failed node by connecting to any arbitrary nodes and downloading an amount of data that is typically far less than the size of the data file. This amount of download is termed the repair bandwidth. Minimum storage regenerating (MSR) codes are a subclass of regenerating codes that require the least amount of network storage; every such code is a maximum distance separable (MDS) code. Further, when a replacement node stores data identical to that in the failed node, the repair is termed as exact. The four principal results of the paper are (a) the explicit construction of a class of MDS codes for d = n - 1 >= 2k - 1 termed the MISER code, that achieves the cut-set bound on the repair bandwidth for the exact repair of systematic nodes, (b) proof of the necessity of interference alignment in exact-repair MSR codes, (c) a proof showing the impossibility of constructing linear, exact-repair MSR codes for d < 2k - 3 in the absence of symbol extension, and (d) the construction, also explicit, of high-rate MSR codes for d = k+1. Interference alignment (IA) is a theme that runs throughout the paper: the MISER code is built on the principles of IA and IA is also a crucial component to the nonexistence proof for d < 2k - 3. To the best of our knowledge, the constructions presented in this paper are the first explicit constructions of regenerating codes that achieve the cut-set bound.

EFFECT OF OFF-STOICHIOMETRY AND TERNARY ADDITIONS ON PLANAR FAULT ENERGIES IN Ni3Al

First principles calculations were done to evaluate the lattice parameter, cohesive energy and stacking fault energies of ordered gamma' (Ll(2)) precipitates in superalloys as a function of composition. It was found that addition of Ti and Ta lead to an increase in lattice parameter and decrease in cohesive energy, while Ni antisites had the opposite effect. Ta and Ti addition to stoichiometric Ni3Al resulted in an initial increase in the energies of APB((111)), CSF(111), APB((001)) and SISF(111). However, at higher concentrations, the fault energies decreased. Addition of Ni antisites decreased the energy of all four faults monotonically. A model based on nearest neighbor bonding was used for Ni-3(Al, Ta), Ni-3(Al, Ti) and Ni-3(Al, Ni) pseudo-binary systems and extended to pseudo- ternary Ni-3(Al, Ta, Ni) and Ni-3(Al, Ti, Ni) systems. Recipes were developed for predicting lattice parameters, cohesive energies and fault energies in pseudo- ternary systems on the basis of coefficients derived from simpler pseudobinary systems. The model predictions were found to be in good agreement with first principles calculations for lattice parameters, cohesive energies, and energies of APB((111)) and CSF(111).