Search

We study codes with parameters of $q$ -ary shortened Hamming codes, i.e., $(n=(q^{m}-q)/(q-1), q^{n-m}, 3)_{q}$. Firstly, we prove the fact mentioned in 1998 by Brouwer et al. that such codes are optimal, generalizing it to a bound for multifold packings of radius-1 balls, with a corollary for multiple coverings. In particular, we show that the punctured Hamming code is an optimal $q$ -fold packing with minimum distance 2. Secondly, for every admissible length starting from $n=20$ , we show the existence of 4-ary codes with parameters of shortened 1-perfect codes that cannot be obtained by shortening a 1-perfect code. [ABSTRACT FROM AUTHOR]

We study the k-Galois linear complementary dual (LCD) codes over the finite chain ring R = Fq + uFq with u2 = 0, where q = pe and p is a prime number. We give a sufficient condition on the generator matrix for the existence of k-Galois LCD codes over R. Finally, we show that a linear code over R (for k = 0, q > 3) is equivalent to a Euclidean LCD code, and a linear code over R (for 0, (pe−k + 1) (pe−1) and (pe−1)/(pe−k + 1) > 1) is equivalent to a k-Galois LCD code. [ABSTRACT FROM AUTHOR]

In this paper, several classes of three-weight codes and two-weight codes for the homogeneous metric over the chain ring R = F p + u F p + ⋯ + u k - 1 F p , with u k = 0 , are constructed that generalize the construction of Shi et al. (IEEE Commun. Lett. 20(12):2346–2349, 2016), which is the special case of p = k = 2. These codes are defined as trace codes. In some cases of their defining sets, they are abelian. Their homogeneous weight distributions are computed by using exponential sums. In particular, in the two-weight case, we give some conditions of optimality of their Gray images by using the Griesmer bound. Their dual homogeneous distance is also given. The codewords of these codes are shown to be minimal for inclusion of supports, a fact favorable to an application to secret sharing schemes. [ABSTRACT FROM AUTHOR]

In this paper, two different Gray-like maps from $Z_{p}^\alpha \times Z_{p^{k}}^\beta $ , where $p$ is prime, to $Z_{p}^{n}$ , $n={\alpha +\beta p^{k-1}}$ , denoted by $\varphi $ and $\Phi $ , respectively, are presented. We have determined the connection between the weight enumerators among the image codes under these two mappings. We show that if $C$ is a $Z_{p} Z_{p^{k}}$ -additive code, and $C^\bot $ is its dual, then the weight enumerators of the image $p$ -ary codes $\varphi (C)$ and $\Phi (C^\bot)$ are formally dual. This is a partial generalization of [D. S. Krotov, On $Z_{2^{k}}$ -dual binary codes, IEEE Transactions Information Theory 53 (2007), 1532–1537], and the result is generalized to odd characteristic $p$ and mixed alphabet. In addition, a construction of 1-perfect additive codes in the mixed $Z_{p} Z_{p^{2}}\ldots Z_{p^{k}}$ alphabet is given. [ABSTRACT FROM AUTHOR]

Numerical results indicate that advection of momentum in the boundary layer may significantly alter both the structure of the planetary boundary layer and its influence on the overlying free atmosphere. However, due to the nonlinearity of the inertial terms, it is always difficult to obtain the analytical solution of the boundary-layer model that retains the flow acceleration. In order to overcome this difficulty, the geostrophic momentum (hereafter GM) approximation has been introduced into boundary-layer models. By replacing the advected momentum with the geostrophic wind, the effect of the flow acceleration is partially considered and the original nonlinear partial differential equation set is converted to ordinary differential equations, the solutions of which can be obtained easily with standard techniques. However, the model employing GM fails to capture the features of the boundary layer when the spatio-temporal variation of the boundary-layer flow cannot be properly approximated by the geostrophic wind. In the present work, a modified boundary-layer model with the inertial acceleration in a different approximate form is proposed, in which the advecting wind instead of the advected momentum is approximated by the geostrophic wind (hereafter GAM). Comparing the horizontal velocity and boundary-layer pumping obtained from the classical Ekman theory, and the model incorporating (i) GM and (ii) GAM, it is found that the model with GAM describes most facets of the steady well-mixed layer beneath a north-westerly flow with embedded mesoscale perturbations that is considered in the present work. Inspection of the solution of the model with GAM shows that, within the limit of the validation of the model (i.e., the Rossby number RO is not very large and the drag coefficient CD is not too small), the horizontal convergence (divergence) is strengthened by the effect of the inertial acceleration in the region of maximum positive (negative) geostrophic vorticity. Consequently, the boundary-layer pumping there is intensified. It is found that the intensification is firstly strengthened and then weakened as RO or CD increases. [ABSTRACT FROM AUTHOR]

In this work, we study a family of self-dual four circulant codes and a family of self-dual four negacirculant codes, and the exact counting formula is derived for these families of codes. In addition, we prove that asymptotically good self-dual four circulant codes and negacirculant codes over finite fields exist, and both of them satisfy a modified Gilbert-Varshamov bound on the relative minimum distance with asymptotic rate 1 2. [ABSTRACT FROM AUTHOR]

We investigate fat projective linear codes over ${\mathbb Z}_{p^{m}}$ , $m\geqslant 2$ , with two nonzero homogeneous weights (“two-weight codes”), building on the graph theory approach developed by Delsarte for codes over fields. Our main result is the classification of such codes under the additional assumption that the columns of a generator matrix of the code determine a cap in the projective Hjelmslev geometry $\mathop {\mathrm {PHG}}\nolimits (k-1, {\mathbb Z}_{p^{m}})$. This generalizes a result on projective two weight codes with dual distance at least four (Calderbank, 1982). The proof relies on a careful analysis of a certain strongly regular graph built on the cosets of the dual code, and on an interpretation of its parameters in terms of projective Hjelmslev geometry. [ABSTRACT FROM AUTHOR]