Non-unitary-weight Space-Time Block Codes with Minimum Decoding Complexity

Space-Time Block Codes (STBCs) from Complex Orthogonal Designs (CODs) are single-symbol decodable/symbol-by-symbol decodable (SSD); however, SSD codes are obtainable from designs that are not CODs. Recently, two such classes of SSD codes have been studied: (i) Coordinate Interleaved Orthogonal Designs (CIODs) and (ii) Minimum-Decoding-Complexity (MDC) STBCs from Quasi-ODs (QODs). The class of CIODs have non-unitary weight matrices when written as a Linear Dispersion Code (LDC) proposed by Hassibi and Hochwald, whereas the other class of SSD codes including CODs have unitary weight matrices. In this paper, we construct a large class of SSD codes with nonunitary weight matrices. Also, we show that the class of CIODs is a special class of our construction.

Wavelength/Time Multiple-Pulses-per-Row codes: Construction and verification

Two dimensional Optical Orthogonal Codes (OOCs) named Wavelength/Time Multiple-Pulses-per-Row (W/T MPR) codes suitable for use in incoherent fiber-optic code division multiple access (FO-CDMA) networks are reported in [6]. In this paper, we report the construction of W/T MPR codes, using Greedy Algorithm (GA), with distinct 1-D OOCs [1] as the row vectors. We present the W/T MPR codes obtained using the GA. Further, we verify the correlation properties of the generated W/T MPR codes using Matlab.

Simultaneous measurement of aerodynamic and heat transfer data for large angle blunt cones in hypersonic shock tunnel

Aerodynamic forces and fore-body convective surface heat transfer rates over a 60 degrees apex-angle blunt cone have been simultaneously measured at a nominal Mach number of 5.75 in the hypersonic shock tunnel HST2. An aluminum model incorporating a three-component accelerometer-based balance system for measuring the aerodynamic forces and an array of platinum thin-film gauges deposited on thermally insulating backing material flush mounted on the model surface is used for convective surface heat transfer measurement in the investigations. The measured value of the drag coefficient varies by about +/-6% from the theoretically estimated value based on the modified Newtonian theory, while the axi-symmetric Navier-Stokes computations overpredict the drag coefficient by about 9%. The normalized values of measured heat transfer rates at 0 degrees angle of attack are about 11% higher than the theoretically estimated values. The aerodynamic and the heat transfer data presented here are very valuable for the validation of CFD codes used for the numerical computation of How fields around hypersonic vehicles.

Explicit Construction of Optimal Exact Regenerating Codes for Distributed Storage

Erasure coding techniques are used to increase the reliability of distributed storage systems while minimizing storage overhead. Also of interest is minimization of the bandwidth required to repair the system following a node failure. In a recent paper, Wu et al. characterize the tradeoff between the repair bandwidth and the amount of data stored per node. They also prove the existence of regenerating codes that achieve this tradeoff. In this paper, we introduce Exact Regenerating Codes, which are regenerating codes possessing the additional property of being able to duplicate the data stored at a failed node. Such codes require low processing and communication overheads, making the system practical and easy to maintain. Explicit construction of exact regenerating codes is provided for the minimum bandwidth point on the storage-repair bandwidth tradeoff, relevant to distributed-mail-server applications. A sub-space based approach is provided and shown to yield necessary and sufficient conditions on a linear code to possess the exact regeneration property as well as prove the uniqueness of our construction. Also included in the paper, is an explicit construction of regenerating codes for the minimum storage point for parameters relevant to storage in peer-to-peer systems. This construction supports a variable number of nodes and can handle multiple, simultaneous node failures. All constructions given in the paper are of low complexity, requiring low field size in particular.

Evolution of magnetic order in the system LaNi1-xMnxO3 (x < 0.10)

Magnetic susceptibility measurements on dilute solid-solutions LaNi1-xMnxO3 (x < 0.1) have been carried out. With increasing x the magnetic susceptibility behaviour changes from Pauli paramagnetic to Curie-Weiss type. The temperature coefficient of resistance (TCR) changes sign around x = 0.03 but the system seems to be metallic in terms of showing a finite extrapolated conductivity at 0 K even when x = 0.10. The x = 0.10 system shows indications of spin-glass like behaviour.

Non-periodic tilings in 2-dimensions with 4, 6, 8, 10 and 12-fold symmetries

The two dimensional plane can be filled with rhombuses, so as to generate non-periodic tilings with 4, 6, 8, 10 and 12-fold symmetries. Some representative tilings constructed using the rule of inflation are shown. The numerically computed diffraction patterns for the corresponding tilings are also shown to facilitate a comparison with possible X-ray or electron diffraction pictures.

Quantum Error Correction via Codes over GF(2)

It is well known that n-length stabilizer quantum error correcting codes (QECCs) can be obtained via n-length classical error correction codes (CECCs) over GF(4), that are additive and self-orthogonal with respect to the trace Hermitian inner product. But, most of the CECCs have been studied with respect to the Euclidean inner product. In this paper, it is shown that n-length stabilizer QECCs can be constructed via 371 length linear CECCs over GF(2) that are self-orthogonal with respect to the Euclidean inner product. This facilitates usage of the widely studied self-orthogonal CECCs to construct stabilizer QECCs. Moreover, classical, binary, self-orthogonal cyclic codes have been used to obtain stabilizer QECCs with guaranteed quantum error correcting capability. This is facilitated by the fact that (i) self-orthogonal, binary cyclic codes are easily identified using transform approach and (ii) for such codes lower bounds on the minimum Hamming distance are known. Several explicit codes are constructed including two pure MDS QECCs.

Low-Complexity Near-ML Decoding of Large Non-Orthogonal STBCs using Reactive Tabu Search

Non-orthogonal space-time block codes (STBC) with large dimensions are attractive because they can simultaneously achieve both high spectral efficiencies (same spectral efficiency as in V-BLAST for a given number of transmit antennas) as well as full transmit diversity. Decoding of non-orthogonal STBCs with large dimensions has been a challenge. In this paper, we present a reactive tabu search (RTS) based algorithm for decoding non-orthogonal STBCs from cyclic division algebras (CDA) having largedimensions. Under i.i.d fading and perfect channel state information at the receiver (CSIR), our simulation results show that RTS based decoding of 12 X 12 STBC from CDA and 4-QAM with 288 real dimensions achieves i) 10(-3) uncoded BER at an SNR of just 0.5 dB away from SISO AWGN performance, and ii) a coded BER performance close to within about 5 dB of the theoretical MIMO capacity, using rate-3/4 turbo code at a spectral efficiency of 18 bps/Hz. RTS is shown to achieve near SISO AWGN performance with less number of dimensions than with LAS algorithm (which we reported recently) at some extra complexity than LAS. We also report good BER performance of RTS when i.i.d fading and perfect CSIR assumptions are relaxed by considering a spatially correlated MIMO channel model, and by using a training based iterative RTS decoding/channel estimation scheme.

Convolutional Codes for Network-Error Correction

In this work, we introduce convolutional codes for network-error correction in the context of coherent network coding. We give a construction of convolutional codes that correct a given set of error patterns, as long as consecutive errors are separated by a certain interval. We also give some bounds on the field size and the number of errors that can get corrected in a certain interval. Compared to previous network error correction schemes, using convolutional codes is seen to have advantages in field size and decoding technique. Some examples are discussed which illustrate the several possible situations that arise in this context.

On BCH codes over arbitrary integer rings

Bose-C-Hocquenghem (BCH) atdes with symbols from an arbitrary fhite integer ring are derived in terms of their generator polynomials. The derivation is based on the factohation of x to the power (n) - 1 over the unit ring of an appropriate extension of the fiite integer ring. lke eomtruetion is thus shown to be similar to that for BCH codes over fink flelda.

Identifying N60D mutation in omega subunit of Escherichia coli RNA polymerase by bottom-up proteomic approach

Escherichia coli RNA polymerase is a multi-subunit enzyme containing alpha(2)beta beta'omega sigma, which transcribes DNA template to intermediate RNA product in a sequence specific manner. Although most of the subunits are essential for its function, the smallest subunit omega (average molecular mass similar to 10,105 Da) can be deleted without affecting bacterial growth. Creating a mutant of the omega subunit can aid in improving the understanding of its role. Sequencing of rpoZ gene that codes for omega subunit from a mutant variant suggested a substitution mutation at position 60 of the protein: asparagine (N) -> aspartic acid (D). This mutation was verified at the protein level by following a typical mass spectrometry (MS) based bottom-up proteomic approach. Characterization of in-gel trypsin digested samples by reverse phase liquid chromatography (LC) coupled to electrospray ionization (ESI)-tandem mass spectrometry (MS/MS) enabled in ascertaining this mutation. Electron transfer dissociation (ETD) of triply charged (M + 3H)(3+)] tryptic peptides (residues 53-67]), EIEEGLINNQILDVR from wild-type and EIEEGLIDNQILDVR from mutant, facilitated in unambiguously determining the site of mutation at residue 60.