Codes With Local Regeneration and Erasure Correction

Regenerating codes and codes with locality are two coding schemes that have recently been proposed, which in addition to ensuring data collection and reliability, also enable efficient node repair. In a situation where one is attempting to repair a failed node, regenerating codes seek to minimize the amount of data downloaded for node repair, while codes with locality attempt to minimize the number of helper nodes accessed. This paper presents results in two directions. In one, this paper extends the notion of codes with locality so as to permit local recovery of an erased code symbol even in the presence of multiple erasures, by employing local codes having minimum distance >2. An upper bound on the minimum distance of such codes is presented and codes that are optimal with respect to this bound are constructed. The second direction seeks to build codes that combine the advantages of both codes with locality as well as regenerating codes. These codes, termed here as codes with local regeneration, are codes with locality over a vector alphabet, in which the local codes themselves are regenerating codes. We derive an upper bound on the minimum distance of vector-alphabet codes with locality for the case when their constituent local codes have a certain uniform rank accumulation property. This property is possessed by both minimum storage regeneration (MSR) and minimum bandwidth regeneration (MBR) codes. We provide several constructions of codes with local regeneration which achieve this bound, where the local codes are either MSR or MBR codes. Also included in this paper, is an upper bound on the minimum distance of a general vector code with locality as well as the performance comparison of various code constructions of fixed block length and minimum distance.

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 with 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 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 Turan 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.

An Improved Outer Bound on the Storage-Repair-Bandwidth Tradeoff of Exact-Repair Regenerating Codes

While the tradeoff between the amount of data stored and the repair bandwidth of an (n, k, d) regenerating code has been characterized under functional repair (FR), the case of exact repair (ER) remains unresolved. It is known that there do not exist ER codes which lie on the FR tradeoff at most of the points. The question as to whether one can asymptotically approach the FR tradeoff was settled recently by Tian who showed that in the (4, 3, 3) case, the ER region is bounded away from the FR region. The FR tradeoff serves as a trivial outer bound on the ER tradeoff. In this paper, we extend Tian's results by establishing an improved outer bound on the ER tradeoff which shows that the ER region is bounded away from the FR region, for any (n; k; d). Our approach is analytical and builds upon the framework introduced earlier by Shah et. al. Interestingly, a recently-constructed, layered regenerating code is shown to achieve a point on this outer bound for the (5, 4, 4) case. This represents the first-known instance of an optimal ER code that does not correspond to a point on the FR tradeoff.

Layered Exact-Repair Regenerating Codes via Embedded Error Correction and Block Designs

A new class of exact-repair regenerating codes is constructed by stitching together shorter erasure correction codes, where the stitching pattern can be viewed as block designs. The proposed codes have the help-by-transfer property where the helper nodes simply transfer part of the stored data directly, without performing any computation. This embedded error correction structure makes the decoding process straightforward, and in some cases the complexity is very low. We show that this construction is able to achieve performance better than space-sharing between the minimum storage regenerating codes and the minimum repair-bandwidth regenerating codes, and it is the first class of codes to achieve this performance. In fact, it is shown that the proposed construction can achieve a nontrivial point on the optimal functional-repair tradeoff, and it is asymptotically optimal at high rate, i.e., it asymptotically approaches the minimum storage and the minimum repair-bandwidth simultaneously.

On the Bounds of Certain Maximal Linear Codes in a Projective Space

The set of all subspaces of F-q(n) is denoted by P-q(n). The subspace distance d(S)(X, Y) = dim(X) + dim(Y)-2dim(X boolean AND Y) defined on P-q(n) turns it into a natural coding space for error correction in random network coding. A subset of P-q(n) is called a code and the subspaces that belong to the code are called codewords. Motivated by classical coding theory, a linear coding structure can be imposed on a subset of P-q(n). Braun et al. conjectured that the largest cardinality of a linear code, that contains F-q(n), is 2(n). In this paper, we prove this conjecture and characterize the maximal linear codes that contain F-q(n).

An asymmetric homodinuclear complex containing the mu-x-oxobis(mu-x-carboxylato)diruthenium(III) core: X-ray structure of [Ru20(o2ec6H4-p-OMe)3(en) (PPh3)2] (C104)" 3CHC13

Asymmetric tri-bridged diruthenium(III) complexes, [Ru2O(O(2)CR)(3)(en) (PPh(3))(2)](ClO4) (R = C6H4-p-X: X = OMe (1a), Me (1b); en=1,2-diaminoethane), were prepared and structurally characterized. Complex 1a 3CHCl(3), crystallizes in the triclinic space group P (1) over bar with a = 14.029(5), b = 14.205(5), c = 20.610(6) Angstrom, alpha= 107.26(3), beta = 101.84(3), gamma= 97.57(3)degrees, V= 3756(2) Angstrom(3) and Z = 2. The complex has an {Ru-2(mu-O)(mu-O(2)CR)(2)(2+)} core and exhibits [O4PRu(mu-O)RuPO2N2](+) coordination environments for the metal centers. The novel structural feature is the asymmetric arrangement of ligands at the terminal sites of the core which shows an Ru... Ru separation of 3.226(3) Angstrom and an Ru-O-Ru angle of 119.2(5)degrees. An intense visible band observed near 570 nm is assigned to a charge transfer transition involving the d pi-Ru(III) and p pi-mu-O Orbitals. Cyclic voltammetry of the complexes displays a reversible Ru-2(III,III) reversible arrow Ru-2(III,IV) couple near 0.8 V (versus SCE) in MeCN-0.1 M TBAP.

Leveraging coherent distributed space-time codes for noncoherent communication in relay networks via training

For point to point multiple input multiple output systems, Dayal-Brehler-Varanasi have proved that training codes achieve the same diversity order as that of the underlying coherent space time block code (STBC) if a simple minimum mean squared error estimate of the channel formed using the training part is employed for coherent detection of the underlying STBC. In this letter, a similar strategy involving a combination of training, channel estimation and detection in conjunction with existing coherent distributed STBCs is proposed for noncoherent communication in Amplify-and-Forward (AF) relay networks. Simulation results show that the proposed simple strategy outperforms distributed differential space-time coding for AF relay networks. Finally, the proposed strategy is extended to asynchronous relay networks using orthogonal frequency division multiplexing.

Synthesis of novel poly[(2,5-dimethoxy-p-phenylene)vinylene] precursors having two eliminatable groups: An approach for the control of conjugation length

Poly[(2,5-dimethoxy-p-phenylene)vinylene] (DMPPV) of varying conjugation length was synthesized by selective elimination of organic soluble precursor polymers that contained two eliminatable groups, namely, methoxy and acetate groups. These precursor copolymers were in turn synthesized by competitive nucleophilic substitution of the sulfonium polyelectrolyte precursor (generated by the standard Wessling route) using methanol and sodium acetate in acetic acid. The composition of the precursor copolymer, in terms of the relative amounts of methoxy and acetate groups, was controlled by varying the composition of the reaction mixture during nucleophilic substitution. Thermal elimination of these precursor copolymers at 250 degrees C, yielded partially conjugated polymers, whose color varied from light yellow to deep red. FT-IR studies confirmed that, while essentially all the acetate groups were eliminated, the methoxy groups were intact and caused the interruption in conjugation. Preliminary photoluminescence studies of the partially eliminated DMPPV samples showed a gradual shift in the emission maximum from 498 to 598 nm with increasing conjugation lengths, suggesting that the color of LED devices fabricated from such polymers can, in principle, be fine-tuned.

Mechanical processing and microstructural control in hot working of hot isostatically pressed P/M IN-100 superalloy

The hot deformation behavior of hot isostatically pressed (HIPd) P/M IN-100 superalloy has been studied in the temperature range 1000-1200 degrees C and strain rate range 0.0003-10 s(-1) using hot compression testing. A processing map has been developed on the basis of these data and using the principles of dynamic materials modelling. The map exhibited three domains: one at 1050 degrees C and 0.01 s(-1), with a peak efficiency of power dissipation of approximate to 32%, the second at 1150 degrees C and 10 s(-1), with a peak efficiency of approximate to 36% and the third at 1200 degrees C and 0.1 s(-1), with a similar efficiency. On the basis of optical and electron microscopic observations, the first domain was interpreted to represent dynamic recovery of the gamma phase, the second domain represents dynamic recrystallization (DRX) of gamma in the presence of softer gamma', while the third domain represents DRX of the gamma phase only. The gamma' phase is stable upto 1150 degrees C, gets deformed below this temperature and the chunky gamma' accumulates dislocations, which at larger strains cause cracking of this phase. At temperatures lower than 1080 degrees C and strain rates higher than 0.1 s(-1), the material exhibits flow instability, manifested in the form of adiabatic shear bands. The material may be subjected to mechanical processing without cracking or instabilities at 1200 degrees C and 0.1 s(-1), which are the conditions for DRX of the gamma phase.

Axial binding of 2-methylimidazole to the tetraarylcarboxylatodiruthenium (II, III) core: X-ray crystal structure of [Ru-2(O2CC6H4-p-OMe)(4)(2-mimH)(2)](ClO4). 1.75CH(2)Cl(2).H2O

Diruthenium (II. III) complexes of the type [Ru-2(O2CAr)(4) (2-mimH)(2)](ClO4) (Ar = C6H4-p-X : X=OMe,1, X=Me, 2, 2-mimH=2-methylimidazole) have been isolated from the reaction of Ru2Cl(O2CAr)(4) with 2-mimH in CH2Cl2 followed by the addition of NaClO4. The crystal structure of 1.1.75CH(2)Cl(2).H2O has been determined. The crystal belongs to the monoclinic space group p2(1)/c with the following unit cell dimensions for the C40H40N4O16ClRu2.1.75CH(2)Cl(2).H2O (M = 1237.0) : a = 12.347(3)Angstrom, b = 17.615(5)Angstrom, c = 26.148(2)Angstrom,beta = 92.88(1)degrees. v = 5679(2)Angstrom(3). Z=4, D-c = 1.45 g cm(-3). lambda(Mo-K-alpha) = 0.7107 Angstrom, mu(Mo-K-alpha) = 8.1 cm(-1), T = 293 K, R = 0.0815 (wR(2) = 0.2118) for 5834 reflections with 1 > 2 sigma(I). The complex has a tetracarboxylatodiruthenium (II, III) core and two axially bound 2-methylimidazole ligands. The Ru-Ru bond length is 2.290(1)Angstrom. The Ru-Ru bond order is 2.5 and the complex is three-electron paramagnetic. The complex shows an irreversible Ru-2(II,III)-->Ru-2(Il,II) reduction near -0.2 V vs SCE in CH2Cl2-0. 1 MTBAP. The complexes exemplify the first adduct of the tetracarboxylatodiruthenium (II,III) core having N-donor ligands

Co-ordinate Interleaved Distributed Space-Time Coding for Two-Antenna-Relays Networks

Distributed space time coding for wireless relay networks when the source, the destination and the relays have multiple antennas have been studied by Jing and Hassibi. In this set-up, the transmit and the receive signals at different antennas of the same relay are processed and designed independently, even though the antennas are colocated. In this paper, a wireless relay network with single antenna at the source and the destination and two antennas at each of the R relays is considered. A new class of distributed space time block codes called Co-ordinate Interleaved Distributed Space-Time Codes (CIDSTC) are introduced where, in the first phase, the source transmits a T-length complex vector to all the relays;and in the second phase, at each relay, the in-phase and quadrature component vectors of the received complex vectors at the two antennas are interleaved and processed before forwarding them to the destination. Compared to the scheme proposed by Jing-Hassibi, for T >= 4R, while providing the same asymptotic diversity order of 2R, CIDSTC scheme is shown to provide asymptotic coding gain with the cost of negligible increase in the processing complexity at the relays. However, for moderate and large values of P, CIDSTC scheme is shown to provide more diversity than that of the scheme proposed by Jing-Hassibi. CIDSTCs are shown to be fully diverse provided the information symbols take value from an appropriate multidimensional signal set.

Electron Mean Energy, Secondary Ionization Coefficients And (E/P)Crit In Binary-Mixtures Of Sf6-N2 And Ccl2f2-N2

Measurements of the ratio of diffusion coefficient to mobility (D/ mu ) of electrons in SF6-N2 and CCl2F2-N2 mixtures over the range 80p<200 (where E is the electric field in V cm-1 and p is the pressure in Torr reduced to 20 degrees C) are reported. Values of (E/p)c.mix (the critical E/p of the mixture, where alpha = eta ), and the electron mean energies epsilon c.mix corresponding to (E/p)c.mix, are found to vary with the percentage of the electronegative gas in the mixture (F) according to the following relationship: (E/p)c.mix=(E/p)c.N(2)+((E/p)c.A-(E/p)c.N(2)) (1-exp(- beta F/100-F)) and epsilon c.mix= epsilon c.N(2)+( epsilon c.A- epsilon c.N(2)) (1-exp(- beta F/100-F)) where A refers to the attaching gas, either SF6 or CCl2F2 and beta is a constant, equal to 2.43 for SF6 mixtures and 5.12 for CCl2F2 mixtures. In the present study, it has been possible to show that beta is indeed to a factor of synergism. Estimated gamma values (secondary ionisation coefficients) did not show any significant variation with F for F<50.

Spool valve mechanism used in a 20 K Gifford-McMahon cycle cryorefrigerator and its effect on the P-V diagram

The design and fabrication of a spool valve for a two-stage Gifford-McMahon cycle cryorefrigerator is described. The effect of this valve on the P-V diagram and practical methods of reducing the P-V degradation are also discussed.

Fast Iterative Division of p-adic Numbers

A fast iterative scheme based on the Newton method is described for finding the reciprocal of a finite segment p-adic numbers (Hensel code). The rate of generation of the reciprocal digits per step can be made quadratic or higher order by a proper choice of the starting value and the iterating function. The extension of this method to find the inverse transform of the Hensel code of a rational polynomial over a finite field is also indicated.

Systematic Construction of Linear Transform Based Full-Diversity, Rate-One Space-Time Frequency Codes

In this paper, we generalize the existing rate-one space frequency (SF) and space-time frequency (STF) code constructions. The objective of this exercise is to provide a systematic design of full-diversity STF codes with high coding gain. Under this generalization, STF codes are formulated as linear transformations of data. Conditions on these linear transforms are then derived so that the resulting STF codes achieve full diversity and high coding gain with a moderate decoding complexity. Many of these conditions involve channel parameters like delay profile (DP) and temporal correlation. When these quantities are not available at the transmitter, design of codes that exploit full diversity on channels with arbitrary DIP and temporal correlation is considered. Complete characterization of a class of such robust codes is provided and their bit error rate (BER) performance is evaluated. On the other hand, when channel DIP and temporal correlation are available at the transmitter, linear transforms are optimized to maximize the coding gain of full-diversity STF codes. BER performance of such optimized codes is shown to be better than those of existing codes.