Equivalent rate 1/2 quasi-cyclic codes

Chen et al. [1] give a list of quasi-cyclic (2m,m) codes which have the largest minimum distance of any quasi-cyclic code, for various values ofm. We present the weight distribution of these codes. It will be seen that many of the codes found by Chen et al. [1] are equivalent in the sense of having identical weight distributions.

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.

Efficient space-time codes from cyclic division algebras

An overview of space-time code construction based on cyclic division algebras (CDA) is presented. Applications of such space-time codes to the construction of codes optimal under the diversity-multiplexing gain (D-MG) tradeoff, to the construction of the so-called perfect space-time codes, to the construction of optimal space-time codes for the ARQ channel as well as to the construction of codes optimal for the cooperative relay network channel are discussed. We also present a construction of optimal codes based on CDA for a class of orthogonal amplify and forward (OAF) protocols for the cooperative relay network

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.

(v, k, λ) Configurations and self-dual codes

The incidence matrix of a (v, k, λ) configuration is used to construct a (2v, v) and a (2v + 2, v + 1) self-dual code. If the incidence matrix is a circulant, the codes obtained are quasi-cyclic and extended quasi-cyclic, respectively. The weight distributions of some codes of this type are obtained.

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.

Structured Dispersion Matrices From Division Algebra Codes for Space-Time Shift Keying

We propose a novel method of constructing Dispersion Matrices (DM) for Coherent Space-Time Shift Keying (CSTSK) relying on arbitrary PSK signal sets by exploiting codes from division algebras. We show that classic codes from Cyclic Division Algebras (CDA) may be interpreted as DMs conceived for PSK signal sets. Hence various benefits of CDA codes such as their ability to achieve full diversity are inherited by CSTSK. We demonstrate that the proposed CDA based DMs are capable of achieving a lower symbol error ratio than the existing DMs generated using the capacity as their optimization objective function for both perfect and imperfect channel estimation.

Generalized distributive law for ML decoding of space-time block codes

The problem of designing good space-time block codes (STBCs) with low maximum-likelihood (ML) decoding complexity has gathered much attention in the literature. All the known low ML decoding complexity techniques utilize the same approach of exploiting either the multigroup decodable or the fast-decodable (conditionally multigroup decodable) structure of a code. We refer to this well-known technique of decoding STBCs as conditional ML (CML) decoding. In this paper, we introduce a new framework to construct ML decoders for STBCs based on the generalized distributive law (GDL) and the factor-graph-based sum-product algorithm. We say that an STBC is fast GDL decodable if the order of GDL decoding complexity of the code, with respect to the constellation size, is strictly less than M-lambda, where lambda is the number of independent symbols in the STBC. We give sufficient conditions for an STBC to admit fast GDL decoding, and show that both multigroup and conditionally multigroup decodable codes are fast GDL decodable. For any STBC, whether fast GDL decodable or not, we show that the GDL decoding complexity is strictly less than the CML decoding complexity. For instance, for any STBC obtained from cyclic division algebras which is not multigroup or conditionally multigroup decodable, the GDL decoder provides about 12 times reduction in complexity compared to the CML decoder. Similarly, for the Golden code, which is conditionally multigroup decodable, the GDL decoder is only half as complex as the CML decoder.

Conformation-activity correlations for chemotactic tripeptide analogs incorporating dialkyl residues with linear and cyclic alkyl sidechains at position 2

Five stereochemically constrained analogs of the chemotactic tripeptide incorporating 1-aminocycloalkane-1-carboxylic acid (Ac(n)c) and alpha,alpha-dialkylglycines (Deg, diethylglycine; Dpg, n,n-dipropylglycine and Dbg, n,n-dibutylglycine) at position 2 have been synthesized. NMR studies of peptides For-Met-Xxx-Phe-OMe (Xxx = Ac(7)c, I; Ac(8)c, II; Deg, III; Dpg, IV and Dbg, V; For, formyl) establish that peptides with cycloalkyl residues, I and II, adopt folded beta-turn conformations in CDCl3 and (CD3)(2)SO. In contrast, analogs with linear alkyl sidechains, III-V, favour fully extended (C-5) conformations in solution. Peptides I-V exhibit high activity in inducing beta-glucosaminidase release from rabbit neutrophils, with ED(50) values ranging from 1.4-8.0 x 10(-11)M. In human neutrophils the Dxg peptides III-V have ED(50) values ranging from 2.3 x 10(-8) to 5.9 x 10(-10) M, with the activity order being V > IV > III. While peptides I-IV are less active than the parent. For-Met-Leu-Phe-OH, in stimulating histamine release from human basophils, the Dbg peptide V is appreciably more potent, suggesting its potential utility as a probe for formyl peptide receptors.

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.

Liquefaction And Pore Water Pressure Generation In Sand - A Cyclic Strain Approach

This paper presents the results of laboratory investigation carried out on Ahmedabad sand on the liquefaction and pore water pressure generation during strain controled cyclic loading. Laboratory experiments were carried out on representative natural sand samples (base sand) collected from earthquake-affected area of Ahmedabad City of Gujarat State in India. A series of strain controled cyclic triaxial tests were carried out on isotropically compressed samples to study the influence of different parameters such as shear strain amplitude, initial effective confining pressure, relative density and percentage of non-plastic fines on the behavior of liquefaction and pore water pressure generation. It has been observed from the laboratory investigation that the potential for liquefaction of the sandy soils depends on the shear strain amplitude, initial relative density, initial effective confining pressure and non-plastic fines. In addition, an empirical relationship between pore pressure ratio and cycle ratio independent of the number of cycles of loading, relative density, confining pressure, amplitude of shear strain and non-plastic fines has been proposed.

Disulfide luminescence. Emission characteristics of cyclic tetrapeptide disulfides

Luminescence has been detected in cyclic tetrapeptide disulfides containing only nonaromatic residues. Excitation of the S-S- n-cr transition between 280 and 290 nm leads to.ernission in the region 300-340 nm. The position and intensity of the emission band depends on the stereochemistry of the peptide and polarity of the solvent. Quantum yields ranging from 0.002 to 0.026 have been determined. Disulfide luminescence is quenched by oxygen and enhanced in solutions saturated with nitrogen. Contributions from disulfide linkages should be considered, when analysing the emission spectra of proteins, lacking tryptophan but having a high cystine content.

Small-amplitude cyclic voltammetry: Part I. A simple fourier synthesis approach

Current-potential relationships are derived for small-amplitude periodic inputs for linear electrochemical systems using a Fourier synthesis procedure. Specific results have been obtained for a triangular potential waveform for two simple model systems.

Conformational analysis of small disulfide loops. Spectroscopic and theoretical studies on a synthetic cyclic tetrapeptide containing cystine

The conformational analysis of the synthetic peptide Boc-Cys-Pro-Val-Cys-NHMe has been carried out, as a model for small disulfide loops, in biologically active polypeptides. 'H NMR studies (270 MHz) establish that the Val(3) and Cys(4) NH groups are solvent shielded, while 13C studies establish an all-trans peptide backbone. Circular dichroism and Raman spectroscopy provide evidence for a right-handed twist of the disulfide bond. Analysis of the vicinal (JaB)c oupling constants for the two Cys residues establishes that XI - *60° for Cys(4), while some flexibility is suggested at Cys( 1). Conformational energy calculations, imposing intramolecular hydrogen bonding constraints, favor a P-turn (type I) structure with Pro(2)-Va1(3) as the corner residues. Theoretical and spectroscopic results are consistent with the presence of a transannular 4 - 1 hydrogen bond between Cys( 1) CO and Cys(4) NH groups, with the Val NH being sterically shielded from the solvent environment.

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.