Efficient visible light induced nuclease activity of a ternary mono-1,10-phenanthroline copper(II) complex containing 2-(methylthio)ethylsalicylaidimine

Ternary Schiff base copper(II) complex [CuL(phen)](ClO4), where HL is 2-(methylthio)ethylsalicylaldimine and phen is 1,10-phenanthroline, has been prepared and structurally characterized by X-ray crystallography. The complex shows a CuN3OS coordination in a square-pyramidal (4 + 1) geometry with the sulfur as an equatorial ligand. The complex is an avid binder to double-stranded DNA in the minor groove and exhibits both photonuclease and chemical nuclease activity. When exposed to UV light of 312 nm (96 W) or visible light of 532 nm (125 W) under aerobic conditions, the complex causes significant cleavage of supercoiled pUC19 DNA in the absence of any externally added reducing agent or H2O2.

Ternary copper(II) complexes of thiosemicarbazones and heterocyclic bases showing N3OS coordination as models for the type-2 centers of copper monooxygenases

Six ternary copper(II) complexes of general formulation [CuLB] (1-6), where L is dianionic ONS-donor thiosemicarbazones derived from the condensation of salicylaldehyde with thiosemicarbazides and B is NN-donor heterocyclic bases like 2,2'-bipyridine, 1,10-phenanthroline and 2,9-dimethyl-1,10-phenanthroline, are prepared from a reaction of copper(II) acetate hydrate with the heterocyclic base (B) and the thiosemicarbazone (H2L) in MeOH, and structurally characterized by X-ray diffraction technique. Crystal structures of the complexes display a distorted square-pyramidal (4 + 1) coordination geometry having the ONS-donor thiosemicarbazone bonded at the basal plane. The chelating heterocyclic bases exhibit axial-equatorial mode of bonding. The complexes are one-electron paramagnetic and they show axial X-band EPR spectra in DMF-toluene glass at 77 K giving g(parallel to)(A(parallel to)) and g(perpendicular to) values of similar to2.2 (175 x 10(-4) cm(-1)) and similar to2.0 indicating a {d(x2-y2)}(1) ground state. The complexes show a d-d band near 570 nm and a charge transfer band near 400 nm in DMF. The complexes are redox active and exhibit a quasireversible Cu(II)-Cu(I) couple in DMF-0.1 M tetrabutylammonium perchlorate near 0.1 V vs. SCE. They are catalytically active in the oxidation of ascorbic acid in presence of dioxygen. The complexes with a CuN3OS coordination model the ascorbate oxidation property of dopamine beta-hydroxylase and peptidylglycine a-hydroxylating monooxygeanase. (C) 2003 Elsevier Science B.V. All rights reserved.

Explicit Codes Uniformly Reducing Repair Bandwidth in Distributed Storage

A distributed storage setting is considered where a file of size B is to be stored across n storage nodes. A data collector should be able to reconstruct the entire data by downloading the symbols stored in any k nodes. When a node fails, it is replaced by a new node by downloading data from some of the existing nodes. The amount of download is termed as repair bandwidth. One way to implement such a system is to store one fragment of an (n, k) MDS code in each node, in which case the repair bandwidth is B. Since repair of a failed node consumes network bandwidth, codes reducing repair bandwidth are of great interest. Most of the recent work in this area focuses on reducing the repair bandwidth of a set of k nodes which store the data in uncoded form, while the reduction in the repair bandwidth of the remaining nodes is only marginal. In this paper, we present an explicit code which reduces the repair bandwidth for all the nodes to approximately B/2. To the best of our knowledge, this is the first explicit code which reduces the repair bandwidth of all the nodes for all feasible values of the system parameters.

Explicit and Optimal Codes for Distributed Storage

In the distributed storage coding problem we consider, data is stored across n nodes in a network, each capable of storing � symbols. It is required that the complete data can be reconstructed by downloading data from any k nodes. There is also the key additional requirement that a failed node be regenerated by connecting to any d nodes and downloading �symbols from each of them. Our goal is to minimize the repair bandwidth d�. In this paper we provide explicit constructions for several parameter sets of interest.

On the Successive Refinability of MIMO channels: DMT and codes

Diversity embedded space time codes are high rate codes that are designed such that they have a high diversity code embedded within them. A recent work by Diggavi and Tse characterizes the performance limits that can be achieved by diversity embedded space-time codes in terms of the achievable Diversity Multiplexing Tradeoff (DMT). In particular, they have shown that the trade off is successively refinable for rayleigh fading channels with one degree of freedom using superposition coding and Successive Interference Cancellation (SIC). However, for Multiple-Input Multiple-Output (MIMO) channels, the questions of successive refinability remains open. We consider MIMO Channels under superposition coding and SIC. We derive an upper bound on the successive refinement characteristics of the DMT. We then construct explicit space time codes that achieve the derived upper bound. These codes, constructed from cyclic division algebras, have minimal delay. Our results establish that when the channel has more than one degree of freedom, the DMT is not successive refinable using superposition coding and SIC. The channels considered in this work can have arbitrary fading statistics.

Performance analysis of wavelength/time codes with and without hard-limiter

Fiber-optic CDMA technology is well suited for high speed local-area-networks (LANs) as it has good salient features. In this paper, we model the wavelength/time multiple-pulses-per-row (W/T MPR) FO-CDMA network channel, as a Z channel. We compare the performances of W/T MPR code with and without hard-limiter and show that significant performance improvement can be achieved by using hard-limiters in the receivers. In broadcast channels, MAI is the dominant source of noise. Hence the performance analysis is carried out considering only MAI and other receiver noises are neglected.

D-MG Tradeoff and Optimal Codes for a Class of AF and DF Cooperative Communication Protocols

Cooperative relay communication in a fading channel environment under the orthogonal amplify-and-forward (OAF), non-orthogonal and orthogonal selection decode-and-forward (NSDF and OSDF) protocols is considered here. The diversity-multiplexing gain tradeoff (DMT) of the three protocols is determined and DMT-optimal distributed space-time code constructions are provided. The codes constructed are sphere decodable and in some instances incur minimum possible delay. Included in our results is the perhaps surprising finding that the OAF and NAF protocols have identical DMT when the time durations of the broadcast and cooperative phases are optimally chosen to suit the respective protocol. Two variants of the NSDF protocol are considered: fixed-NSDF and variable-NSDF protocol. In the variable-NSDF protocol, the fraction of time occupied by the broadcast phase is allowed to vary with multiplexing gain. In the two-relay case, the variable-NSDF protocol is shown to improve on the DMT of the best previously-known static protocol for higher values of multiplexing gain. Our results also establish that the fixed-NSDF protocol has a better DMT than the NAF protocol for any number of relays.

On four-group ML decodable distributed space time codes for cooperative communication

A construction of a new family of distributed space time codes (DSTCs) having full diversity and low Maximum Likelihood (ML) decoding complexity is provided for the two phase based cooperative diversity protocols of Jing-Hassibi and the recently proposed Generalized Non-orthogonal Amplify and Forward (GNAF) protocol of Rajan et al. The salient feature of the proposed DSTCs is that they satisfy the extra constraints imposed by the protocols and are also four-group ML decodable which leads to significant reduction in ML decoding complexity compared to all existing DSTC constructions. Moreover these codes have uniform distribution of power among the relays as well as in time. Also, simulations results indicate that these codes perform better in comparison with the only known DSTC with the same rate and decoding complexity, namely the Coordinate Interleaved Orthogonal Design (CIOD). Furthermore, they perform very close to DSTCs from field extensions which have same rate but higher decoding complexity.

A Combinatorial Family of Near Regular LDPC Codes

An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes are near regular in the sense that the degree of a left/right vertex is allowed to differ by at most one from the average. The construction yields in quadratic time complexity an asymptotic code family with provable lower bounds on the rate and the girth for a given choice of block length and average degree. The construction gives flexibility in the choice of design parameters of the code like rate, girth and average degree. Performance simulations of iterative decoding algorithm for the AWGN channel on codes designed using the method demonstrate that these codes perform better than regular PEG codes and MacKay codes of similar length for all values of Signal to noise ratio.

Combinatorial Representations of Block Codes

We look at graphical descriptions of block codes known as trellises, which illustrate connections between algebra and graph theory, and can be used to develop powerful decoding algorithms. Trellis sizes for linear block codes are known to grow exponentially with the code parameters. Of considerable interest to coding theorists therefore, are more compact descriptions called tail-biting trellises which in some cases can be much smaller than any conventional trellis for the same code . We derive some interesting properties of tail-biting trellises and present a new decoding algorithm.