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.

Composition dependent non-ideality in aqueous binary mixtures as a signature of avoided spinodal decomposition

We explore the potential energy landscape of structure breaking binary mixtures (SBBM) where two constituents dislike each other, yet remain macroscopically homogeneous at intermediate to high temperatures. Interestingly, we find that the origin of strong composition dependent non-ideal behaviour lies in its phase separated inherent structure. The inherent structure (IS) of SBBM exhibits bi-continuous phase as is usually formed during spinodal decomposition. We draw analogy of this correlation between non-ideality and phase separation in IS to explain observation of non-ideality in real aqueous mixtures of small amphiphilic solutes, containing both hydrophilic and hydrophobic groups. Although we have not been able to obtain IS of these liquids, we find that even at room temperature these liquids sustain formation of fluctuating, transient bi-continuous phase, with limited lifetime (tau less than or similar to 20 ps). While in the model (A, B) binary mixture, the non-ideal composition dependence can be considered as a fluctuation from a phase separated state, a similar scenario is expected to be responsible for the unusually strong non-ideality in these aqueous binary mixtures.

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.

Third post-Newtonian gravitational waveforms for compact binary systems in general orbits: Instantaneous terms

We compute the instantaneous contributions to the spherical harmonic modes of gravitational waveforms from compact binary systems in general orbits up to the third post-Newtonian (PN) order. We further extend these results for compact binaries in quasielliptical orbits using the 3PN quasi-Keplerian representation of the conserved dynamics of compact binaries in eccentric orbits. Using the multipolar post-Minkowskian formalism, starting from the different mass and current-type multipole moments, we compute the spin-weighted spherical harmonic decomposition of the instantaneous part of the gravitational waveform. These are terms which are functions of the retarded time and do not depend on the history of the binary evolution. Together with the hereditary part, which depends on the binary's dynamical history, these waveforms form the basis for construction of accurate templates for the detection of gravitational wave signals from binaries moving in quasielliptical orbits.

A pseudo-binary interdiffusion study in the beta-Ni(Pt)Al phase

Interdiffusion study is conducted in the Ni-rich part of the beta-Ni(Pt)Al phase following the pseudo-binary approach. Interdiffusion coefficients over the whole composition range considered in this study increases with increase in Pt content, which is in line with the theoretical study predicting the decrease in vacancy formation and migration energy because of Pt addition. The trend of change in diffusion coefficient with the increase in Ni and Pt contents indicates that Pt preferably replaces Ni antisites.

Estimation of intrinsic diffusion coefficients in a pseudo-binary diffusion couple

Major drawback of studying diffusion in multi-component systems is the lack of suitable techniques to estimate the diffusion parameters. In this study, a generalized treatment to determine the intrinsic diffusion coefficients in multi-component systems is developed utilizing the concept of a pseudo-binary approach. This is explained with the help of experimentally developed diffusion profiles in the Cu(Sn, Ga) and Cu(Sn, Si) solid solutions. (C) 2015 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Spatial modulation of the composition of a binary liquid near a repulsive wall

When a binary liquid is confined by a strongly repulsive wall, the local density is depleted near the wall and an interface similar to that between the liquid and its vapor is formed. This analogy suggests that the composition of the binary liquid near this interface should exhibit spatial modulation similar to that near a liquid-vapor interface even if the interactions of the wall with the two components of the liquid are the same. The Guggenheim adsorption relation quantifies the concentrations of two components of a binary mixture near a liquid-vapor interface and qualitatively states that the majority (minority) component enriches the interface for negative (positive) mixing energy if the surface tensions of the two components are not very different. From molecular dynamics simulations of binary mixtures with different compositions and interactions we find that the Guggenheim relation is qualitatively satisfied at wall-induced interfaces for systems with negative mixing energy at all state points considered. For systems with positive mixing energy, this relation is found to be qualitatively valid at low densities, while it is violated at state points with high density where correlations in the liquid are strong. This observation is validated by a calculation of the density profiles of the two components of the mixture using density functional theory with the Ramakrishnan-Yussouff free-energy functional. Possible reasons for the violation of the Guggenheim relation are discussed.

Construction of Singer Subgroup Orbit Codes Based on Cyclic Difference Sets

A recent approach for the construction of constant dimension subspace codes, designed for error correction in random networks, is to consider the codes as orbits of suitable subgroups of the general linear group. In particular, a cyclic orbit code is the orbit of a cyclic subgroup. Hence a possible method to construct large cyclic orbit codes with a given minimum subspace distance is to select a subspace such that the orbit of the Singer subgroup satisfies the distance constraint. In this paper we propose a method where some basic properties of difference sets are employed to select such a subspace, thereby providing a systematic way of constructing cyclic orbit codes with specified parameters. We also present an explicit example of such a construction.

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).

Binary group III-nitride based heterostructures: band offsets and transport properties

In the last few years, there has been remarkable progress in the development of group III-nitride based materials because of their potential application in fabricating various optoelectronic devices such as light emitting diodes, laser diodes, tandem solar cells and field effect transistors. In order to realize these devices, growth of device quality heterostructures are required. One of the most interesting properties of a semiconductor heterostructure interface is its Schottky barrier height, which is a measure of the mismatch of the energy levels for the majority carriers across the heterojunction interface. Recently, the growth of non-polar III-nitrides has been an important subject due to its potential improvement on the efficiency of III-nitride-based opto-electronic devices. It is well known that the c-axis oriented optoelectronic devices are strongly affected by the intrinsic spontaneous and piezoelectric polarization fields, which results in the low electron-hole recombination efficiency. One of the useful approaches for eliminating the piezoelectric polarization effects is to fabricate nitride-based devices along non-polar and semi-polar directions. Heterostructures grown on these orientations are receiving a lot of focus due to enhanced behaviour. In the present review article discussion has been carried out on the growth of III-nitride binary alloys and properties of GaN/Si, InN/Si, polar InN/GaN, and nonpolar InN/GaN heterostructures followed by studies on band offsets of III-nitride semiconductor heterostructures using the x-ray photoelectron spectroscopy technique. Current transport mechanisms of these heterostructures are also discussed.