On the Hamming distances of repeated-root constacyclic codes of length 4ps

Let $p$ be an odd prime, $s$, $m$ be positive integers, $\gamma ,\lambda$ be nonzero elements of the finite field ${\mathbb{F}}_{p^m}$ such that ${\gamma }^{p^s}=\lambda$. In this paper, we show that, for any positive integer $\eta$, the Hamming distances of all repeated-root $\lambda$-constacyclic codes of length $\eta p^s$ can be determined by those of certain simple-root $\gamma$-constacyclic codes of length $\eta$. Using this result, Hamming distances of all constacyclic codes of length $4p^s$ are obtained. As an application, we identify all MDS $\lambda$-constacyclic codes of length $4p^s$.     

Spin-Spin Relaxation Process of 23Na-NMR in Na-Loaded NaY

Abstract

Spin-spin relaxation of ²³Na-NMR is observed by the spin echo method at room temperature for Y-type zeolite loaded with Na metal without hydration. For saturated and no levels of loading, the echo decay is well fitted by single exponential function. T ₂ decreases to be 0.25 times smaller by loading. This decrease of T ₂ is explained semiquantitatively with assuming nuclear dipole-dipole interaction between neighboring Na.     

Distance rendering and perception of nearby virtual sound sources with a near-field filter model

Headphone rendering of nearby virtual sound sources represents to date an open issue in 3-D audio, due to a number of technical challenges and temporal requirements involved in the measurement of individual Head-Related Transfer Functions (HRTFs). In order to tackle this problem, we propose a filter model of near-field effects based on the Distance Variation Function (Kan et al., 2009). Thanks to its simple structure and low order, the model can be applied to any far-field virtual auditory display to yield a realistic and computationally efficient near-field compensation of spectral and binaural effects. The model is subjectively evaluated in two psychophysical experiments where the relative distance of pairs of virtually rendered sound sources is judged. Results show that even though sound intensity overshadows subtler near-field effects when it is available as a cue for distance, the model is capable of offering relative distance information of near lateral virtual sources when intensity cues are removed. Furthermore, performances of the model in relative distance rendering are compared to those of alternative near-field rendering methods available in the literature.     

Erratum: The average degree of an edge-chromatic critical graph II

In the article “The average degree of an edge-chromatic critical graph II” by Douglas R. Woodall (J. Graph Theory 56 (2007), 194-218), it was claimed that the average degree of an edge-chromatic critical graph with maximum degree $\mathrm{\Delta }$ is at least $\text{◂⋅▸}\frac{2}{3}\left(\mathrm{\Delta }+1\right)$ if $\mathrm{\Delta }⩾2$, at least $\text{◂+▸}\frac{2}{3}\mathrm{\Delta }+1$ if $\mathrm{\Delta }⩾8$, and at least $\text{◂⋅▸}\frac{2}{3}\left(\mathrm{\Delta }+2\right)$ if $\mathrm{\Delta }⩾15$. Unfortunately there were mistakes in the proof of the last two of these results, which are now proved only if $\mathrm{\Delta }⩾18$ and $\mathrm{\Delta }⩾30$, respectively.     

Linear codes associated to skew-symmetric determinantal varieties

In this article we consider linear codes coming from skew-symmetric determinantal varieties, which are defined by the vanishing of minors of a certain fixed size in the space of skew-symmetric matrices. In odd characteristic, the minimum distances of these codes are determined and a recursive formula for the weight of a general codeword in these codes is given.     

A bound on the Wasserstein-2 distance between linear combinations of independent random variables

We provide a bound on a distance between finitely supported elements and general elements of the unit sphere of ${?}^2\left({\mathbb{N}}^1\right)$. We use this bound to estimate the Wasserstein-2 distance between random variables represented by linear combinations of independent random variables. Our results are expressed in terms of a discrepancy measure related to Nourdin–Peccati’s Malliavin–Stein method. The main application is towards the computation of quantitative rates of convergence to elements of the second Wiener chaos. In particular, we explicit these rates for non-central asymptotic of sequences of quadratic forms and the behavior of the generalized Rosenblatt process at extreme critical exponent.