On the anomalous superfluid hydrodynamics

It has been shown by Son and Sur\'owka that the presence of anomaly in hydrodynamics with global U(1) symmetry can induce vortical and magnetic currents. The induced current is uniquely determined by anomaly from the existence of an entropy current with non-negative divergence. In this work, we extended the analysis to hydrodynamics with U(1) symmetry spontaneously broken, i.e. U(1) superfluid hydrodynamics. We found that all possible first order gradient corrections are determined up to five arbitrary functions, with the entropy current containing one arbitrary function. Furthermore, the stress tensor does not receive correction from terms proportional to the magnetic field.Comment: 22 pages, missing terms included, with qualitative change of the result

The binary weight distribution of the extended (2 sup m, 2 sup m-4) code of Reed-Solomon code over GF(2 sup m) with generator polynomial (x-alpha sup 2) (x-alpha sup 3)

Consider an (n,k) linear code with symbols from GF(2 sup m). If each code symbol is represented by a binary m-tuple using a certain basis for GF(2 sup m), a binary (nm,km) linear code called a binary image of the original code is obtained. A lower bound is presented on the minimum weight enumerator for a binary image of the extended (2 sup m, 2 sup m -4) code of Reed-Solomon code over GF(2 sup m) with generator polynomical (x - alpha)(x- alpha squared)(x - alpha cubed) and its dual code, where alpha is a primitive element in GF(2 sup m)

On linear structure and phase rotation invariant properties of block 2(sup l)-PSK modulation codes

Two important structural properties of block 2(l)-ary PSK (phase shift keying) modulation codes, linear structure and phase symmetry, are investigated. For an additive white Gaussian noise (AWGN) channel, the error performance of a modulation code depends on its squared Euclidean distance distribution. Linear structure of a code makes the error performance analysis much easier. Phase symmetry of a code is important in resolving carrier phase ambiguity and ensuring rapid carrier phase resynchronization after temporary loss of synchronization. It is desirable for a code to have as many phase symmetries as possible. A 2(l)-ary modulation code is represented here as a code with symbols from the integer group. S sub 2(l) PSK = (0,1,2,...,2(l)-1), under the modulo-2(l) addition. The linear structure of block 2(l)-ary PSK modulation codes over S sub 2(l)-ary PSK with respect to the modulo-2(l) vector addition is defined, and conditions under which a block 2(l)-ary PSK modulation code is linear are derived. Once the linear structure is developed, phase symmetry of a block 2(l)-ary PSK modulation code is studied. It is a necessary and sufficient condition for a block 2(l)-PSK modulation code, which is linear as a binary code, to be invariant under 180 deg/2(l-h) phase rotation, for 1 is less than or equal to h is less than or equal to l. A list of short 8-PSK and 16-PSK modulation codes is given, together with their linear structure and the smallest phase rotation for which a code is invariant

Serial-parallel multiplication in Galois fields

A method for multiplying two elements from the Galois field GF(2 sup ms) is presented. This method provides a tradeoff between speed and complexity

Spatial Monopoly Pricing in a Stochastic Environment

This paper reexamines the welfare implications of three pricing regimes (mill, uniform and discriminatory) for a monopoly in a stochastic environment. It con-siders a risk-averse monopolist faces two markets with stochastic and linear demands. The monopolist is assumed to commit to an irreversible price in each market before the uncertainty is resolved. Several unconventional results are shown to be triggered by the presence of demand uncertainty. The reason for the reversal of orthodox intuition is the asymmetry in the risk chacteristics of the markets and the willingness of the monopolist to trade increased level of expected prots for reduced risk.spatial pricing, monopoly, demand uncertainty

Multi-stage decoding for multi-level block modulation codes

Various types of multistage decoding for multilevel block modulation codes, in which the decoding of a component code at each stage can be either soft decision or hard decision, maximum likelihood or bounded distance are discussed. Error performance for codes is analyzed for a memoryless additive channel based on various types of multi-stage decoding, and upper bounds on the probability of an incorrect decoding are derived. It was found that, if component codes of a multi-level modulation code and types of decoding at various stages are chosen properly, high spectral efficiency and large coding gain can be achieved with reduced decoding complexity. It was found that the difference in performance between the suboptimum multi-stage soft decision maximum likelihood decoding of a modulation code and the single stage optimum decoding of the overall code is very small, only a fraction of dB loss in SNR at the probability of an incorrect decoding for a block of 10(exp -6). Multi-stage decoding of multi-level modulation codes really offers a way to achieve the best of three worlds, bandwidth efficiency, coding gain, and decoding complexity