Fast-Decodable MIDO Codes With Large Coding Gain

In this paper, a new method is proposed to obtain full-diversity, rate-2 (rate of two complex symbols per channel use) space-time block codes (STBCs) that are full-rate for multiple input double output (MIDO) systems. Using this method, rate-2 STBCs for 4 x 2, 6 x 2, 8 x 2, and 12 x 2 systems are constructed and these STBCs are fast ML-decodable, have large coding gains, and STBC-schemes consisting of these STBCs have a non-vanishing determinant (NVD) so that they are DMT-optimal for their respective MIDO systems. It is also shown that the Srinath-Rajan code for the 4 x 2 system, which has the lowest ML-decoding complexity among known rate-2 STBCs for the 4x2 MIDO system with a large coding gain for 4-/16-QAM, has the same algebraic structure as the STBC constructed in this paper for the 4 x 2 system. This also settles in positive a previous conjecture that the STBC-scheme that is based on the Srinath-Rajan code has the NVD property and hence is DMT-optimal for the 4 x 2 system.

Goldstone modes and bifurcations in phase-separated binary condensates at finite temperature

We show that the third Goldstone mode, which emerges in binary condensates at phase separation, persists to higher interspecies interaction for density profiles where one component is surrounded on both sides by the other component. This is not the case with symmetry-broken density profiles where one species is entirely to the left and the other is entirely to the right. We, then, use Hartree-Fock-Bogoliubov theory with Popov approximation to examine the mode evolution at T not equal 0 and demonstrate the existence of mode bifurcation near the critical temperature. The Kohn mode, however, exhibits deviation from the natural frequency at finite temperatures after the phase separation. This is due to the exclusion of the noncondensate atoms in the dynamics.

Vortex reconnections between coreless vortices in binary condensates

Vortex reconnections plays an important role in the turbulent flows associated with the superfluids. To understand the dynamics, we examine the reconnections of vortex rings in the superfluids of dilute atomic gases confined in trapping potentials using Gross-Petaevskii equation. Further more we study the reconnection dynamics of coreless vortex rings, where one of the species can act as a tracer.

Effect of adsorbate loading on selectivity during adsorption of C/C and C/C n-alkane binary mixtures in silicalite

Adsorption experiments of mixtures of long chain alkanes into silicalite under liquid phase conditions show selectivity inversion and azeotrope formation. These effects are due to the subtle interplay between the size of the adsorbed molecules and pore topology of the adsorbent. In this study, the selective uptake of lighter component during liquid phase adsorption of C/C and C/C n-alkane binary mixtures in the zeolite silicalite is understood through configurational bias grand-canonical Monte Carlo molecular simulation technique and a coarse-grained siting analysis. The simulations are conducted under conditions of low and intermediate levels of loading. The siting pattern of the adsorbates inside the zeolite pores explain the selectivity as seen in experiments.

Magnetism and superconductivity in Sb-doped binary and ternary iron chalcogenide single crystals

We report the single crystal growth of antimony doped Fe1+yTe and Fe1+yTe0.5Se0.5 (Fe1+ySbxTe1-x (x=0, 2%, 5%) and Fe1+yTe0.49Se0.49Sb0.02) by a modified horizontal Bridgman method. Growth parameters are optimized to obtain high quality single crystals. The antiferromagnetic (AFM) transition at T-N = 62.2 K which is a first order transition, shifts to lower temperature on doping in Fe1+yTe. Alternately when the chalcogen site of the ternary compound Fe1+yTe0.5Se0.5 is doped with Sb, superconductivity is preserved albeit the superconducting transition temperature (T-C) falls slightly and a concomitant reduction occurs in superconducting volume fraction. (C) 2013 Elsevier B.V. All rights reserved,

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.

Calculation of three-phase methane-ethane binary clathrate hydrate phase equilibrium from Monte Carlo molecular simulations

Methane and ethane are the simplest hydrocarbon molecules that can form clathrate hydrates. Previous studies have reported methods for calculating the three-phase equilibrium using Monte Carlo simulation methods in systems with a single component in the gas phase. Here we extend those methods to a binary gas mixture of methane and ethane. Methane-ethane system is an interesting one in that the pure components form sII clathrate hydrate whereas a binary mixture of the two can form the sII clathrate. The phase equilibria computed from Monte Carlo simulations show a good agreement with experimental data and are also able to predict the sI-sII structural transition in the clathrate hydrate. This is attributed to the quality of the TIP4P/Ice and TRaPPE models used in the simulations. (C) 2014 Elsevier B.V. All rights reserved.

The generalized Onsager model for a binary gas mixture

The Onsager model for the secondary flow field in a high-speed rotating cylinder is extended to incorporate the difference in mass of the two species in a binary gas mixture. The base flow is an isothermal solid-body rotation in which there is a balance between the radial pressure gradient and the centrifugal force density for each species. Explicit expressions for the radial variation of the pressure, mass/mole fractions, and from these the radial variation of the viscosity, thermal conductivity and diffusion coefficient, are derived, and these are used in the computation of the secondary flow. For the secondary flow, the mass, momentum and energy equations in axisymmetric coordinates are expanded in an asymptotic series in a parameter epsilon = (Delta m/m(av)), where Delta m is the difference in the molecular masses of the two species, and the average molecular mass m(av) is defined as m(av) = (rho(w1)m(1) + rho(w2)m(2))/rho(w), where rho(w1) and rho(w2) are the mass densities of the two species at the wall, and rho(w) = rho(w1) + rho(w2). The equation for the master potential and the boundary conditions are derived correct to O(epsilon(2)). The leading-order equation for the master potential contains a self-adjoint sixth-order operator in the radial direction, which is different from the generalized Onsager model (Pradhan & Kumaran, J. Fluid Mech., vol. 686, 2011, pp. 109-159), since the species mass difference is included in the computation of the density, viscosity and thermal conductivity in the base state. This is solved, subject to boundary conditions, to obtain the leading approximation for the secondary flow, followed by a solution of the diffusion equation for the leading correction to the species mole fractions. The O(epsilon) and O(epsilon(2)) equations contain inhomogeneous terms that depend on the lower-order solutions, and these are solved in a hierarchical manner to obtain the O(epsilon) and O(epsilon(2)) corrections to the master potential. A similar hierarchical procedure is used for the Carrier-Maslen model for the end-cap secondary flow. The results of the Onsager hierarchy, up to O(epsilon(2)), are compared with the results of direct simulation Monte Carlo simulations for a binary hard-sphere gas mixture for secondary flow due to a wall temperature gradient, inflow/outflow of gas along the axis, as well as mass and momentum sources in the flow. There is excellent agreement between the solutions for the secondary flow correct to O(epsilon(2)) and the simulations, to within 15 %, even at a Reynolds number as low as 100, and length/diameter ratio as low as 2, for a low stratification parameter A of 0.707, and when the secondary flow velocity is as high as 0.2 times the maximum base flow velocity, and the ratio 2 Delta m/(m(1) + m(2)) is as high as 0.5. Here, the Reynolds number Re = rho(w)Omega R-2/mu, the stratification parameter A = root m Omega R-2(2)/(2k(B)T), R and Omega are the cylinder radius and angular velocity, m is the molecular mass, rho(w) is the wall density, mu is the viscosity and T is the temperature. The leading-order solutions do capture the qualitative trends, but are not in quantitative agreement.

Effect of shrinkage induced flow on binary alloy dendrite growth: An equivalent undercooling model

This paper presents a theoretical model for studying the effects of shrinkage induced flow on the growth rate of binary alloy dendrites. An equivalent undercooling of the melt is defined in terms of ratio of the phase densities to represent the change in dendrite growth rate due to variation in solutal and thermal transport resulting from shrinkage induced flow. Subsequently, results for dendrite growth rate predicted by the equivalent undercooling model is compared with the corresponding predictions obtained using an enthalpy based numerical method for dendrite growth with shrinkage. The agreement is found to be good. Published by Elsevier Ltd.

Optimal Binary Power Control for Underlay CR With Different Interference Constraints and Impact of Channel Estimation Errors

Adapting the power of secondary users (SUs) while adhering to constraints on the interference caused to primary receivers (PRxs) is a critical issue in underlay cognitive radio (CR). This adaptation is driven by the interference and transmit power constraints imposed on the secondary transmitter (STx). Its performance also depends on the quality of channel state information (CSI) available at the STx of the links from the STx to the secondary receiver and to the PRxs. For a system in which an STx is subject to an average interference constraint or an interference outage probability constraint at each of the PRxs, we derive novel symbol error probability (SEP)-optimal, practically motivated binary transmit power control policies. As a reference, we also present the corresponding SEP-optimal continuous transmit power control policies for one PRx. We then analyze the robustness of the optimal policies when the STx knows noisy channel estimates of the links between the SU and the PRxs. Altogether, our work develops a holistic understanding of the critical role played by different transmit and interference constraints in driving power control in underlay CR and the impact of CSI on its performance.

OPTIMALITY OF THE PRODUCT-MATRIX CONSTRUCTION FOR SECURE MSR REGENERATING CODES

In this paper, we consider the security of exact-repair regenerating codes operating at the minimum-storage-regenerating (MSR) point. The security requirement (introduced in Shah et. al.) is that no information about the stored data file must be leaked in the presence of an eavesdropper who has access to the contents of l(1) nodes as well as all the repair traffic entering a second disjoint set of l(2) nodes. We derive an upper bound on the size of a data file that can be securely stored that holds whenever l(2) <= d - k +1. This upper bound proves the optimality of the product-matrix-based construction of secure MSR regenerating codes by Shah et. al.

Structural, magnetic and electrochemical investigation of novel binary Na2-x(Fe1-yMny)P2O7 (0 <= y <= 1) pyrophosphate compounds for rechargeable sodium-ion batteries

Pyrophosphate cathodes have been recently reported as a competent family of insertion compounds for sodium-ion batteries. In the current study, we have investigated the binary Na2 - x(Fe1 - yMny)P2O7 (0 <= y <= 1) pyrophosphate family, synthesized by the classical solid-state method. They form a continuous solid solution maintaining triclinic P-1 (#2) symmetry. The local structural coordination differs mainly by different degrees of Na site occupancy and preferential occupation of the Fe2 site by Mn. The structural and magnetic properties of these mixed-metal pyrophosphate phases have been studied. In each case, complete Fe3+/Fe2+ redox activity has been obtained centered at 3 V vs. Na. The Fe3+/Fe2+ redox process involves multiple steps between 2.5 and 3 V owing to Na-cation ordering during electrochemical cycling, which merge to form a broad single Fe3+/Fe2+ redox peak upon progressive Mn-doping. (C) 2014 Elsevier B.V. All rights reserved.

A Matroidal Framework for Network-Error Correcting Codes

Matroidal networks were introduced by Dougherty et al. and have been well studied in the recent past. It was shown that a network has a scalar linear network coding solution if and only if it is matroidal associated with a representable matroid. A particularly interesting feature of this development is the ability to construct (scalar and vector) linearly solvable networks using certain classes of matroids. Furthermore, it was shown through the connection between network coding and matroid theory that linear network coding is not always sufficient for general network coding scenarios. The current work attempts to establish a connection between matroid theory and network-error correcting and detecting codes. In a similar vein to the theory connecting matroids and network coding, we abstract the essential aspects of linear network-error detecting codes to arrive at the definition of a matroidal error detecting network (and similarly, a matroidal error correcting network abstracting from network-error correcting codes). An acyclic network (with arbitrary sink demands) is then shown to possess a scalar linear error detecting (correcting) network code if and only if it is a matroidal error detecting (correcting) network associated with a representable matroid. Therefore, constructing such network-error correcting and detecting codes implies the construction of certain representable matroids that satisfy some special conditions, and vice versa. We then present algorithms that enable the construction of matroidal error detecting and correcting networks with a specified capability of network-error correction. Using these construction algorithms, a large class of hitherto unknown scalar linearly solvable networks with multisource, multicast, and multiple-unicast network-error correcting codes is made available for theoretical use and practical implementation, with parameters, such as number of information symbols, number of sinks, number of coding nodes, error correcting capability, and so on, being arbitrary but for computing power (for the execution of the algorithms). The complexity of the construction of these networks is shown to be comparable with the complexity of existing algorithms that design multicast scalar linear network-error correcting codes. Finally, we also show that linear network coding is not sufficient for the general network-error correction (detection) problem with arbitrary demands. In particular, for the same number of network errors, we show a network for which there is a nonlinear network-error detecting code satisfying the demands at the sinks, whereas there are no linear network-error detecting codes that do the same.

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.