相关论文: Perfect Mannheim, Lipschitz and Hurwitz weight cod…
A hybrid code can simultaneously encode classical and quantum information into quantum digits such that the information is protected against errors when transmitted through a quantum channel. It is shown that a hybrid code has the…
Let $p$ be a prime such that $p \equiv 2$ or $3$ mod $5$. Linear block codes over the non-commutative matrix ring of $2 \times 2$ matrices over the prime field $GF(p)$ endowed with the Bachoc weight are derived as isometric images of linear…
We generalise the sum-of-divisors-function $\sigma$ and evenness to the rings of integers of certain algebraic number fields. In particular, we present necessary and sufficient conditions for even Eisenstein integers to be (norm-)perfect…
The basis elements spanning the Sato Grassmannian element corresponding to the KP $\tau$-function that serves as generating function for rationally weighted Hurwitz numbers are shown to be Meijer $G$-functions. Using their Mellin-Barnes…
Let {\alpha} be a prime Hurwitz integer. H{\alpha}, which is the set of residual class with respect to related modulo function in the rings of Hurwitz integers, is a subset of H, which is the set of all Hurwitz integers. We consider left…
We study the locally recoverable codes on algebraic curves. In the first part of this article, we provide a bound of generalized Hamming weight of these codes. Whereas in the second part, we propose a new family of algebraic geometric LRC…
In this paper, we give upper bounds on the sizes of $(d, L)$ list-decodable codes in the Hamming metric space from covering codes with the covering radius smaller than or equal to $d$. When the list size $L$ is $1$, this gives many new…
This work concerns superharmonic perturbations of a Gaussian measure given by a special class of positive weights in the complex plane of the form $w(z) = \exp(-|z|^2 + U^{\mu}(z))$, where $U^{\mu}(z)$ is the logarithmic potential of a…
We define generalized Hamming weights for almost affine codes. We show how various aspects and applications of generalized Hamming weights for linear codes, such as Wei duality, generalized Kung's bound, profiles, connection to wire-tap…
We construct a class of linear codes by choosing a proper defining set and determine their complete weight enumerators and weight enumerators. The results show that they are at most three-weight codes and they are suitable for applications…
We provide a combinatorial construction for linear codes attaining the maximum possible number of distinct weights. We then introduce the related problem of determining the existence of linear codes with an arbitrary number of distinct…
In this paper, we obtain the weighted boundedness for the local multi(sub)linear Hardy-Littlewood maximal operators and local multilinear fractional integral operators associated with the local Muckenhoupt weights on Gaussian measure…
Gauginos might play a crucial role in the search for supersymmetry at the Large Hadron Collider (LHC). Mass predictions for gauginos are rather robust and often related to the values of the gauge couplings. We analyse the ratios of gaugino…
Universal bounds for the potential energy of weighted spherical codes are obtained by linear programming. The universality is in the sense of Cohn-Kumar -- every attaining code is optimal with respect to a large class of potential functions…
In this paper we present some new upper bounds of the Cusa-Huygens and the Huygens approximations. Bounds are obtained in the forms of some polynomial and some rational functions.
We formulate Goldbach type questions for Gaussian, Hurwitz, Octavian and Eisenstein primes. They are different from Goldbach type statements by Takayoshi Mitsui from 1960 for number fields or C.A. Holben and James Jordan from 1968 for…
The generalized Hamming weight of linear codes is a natural generalization of the minimum Hamming distance. They convey the structural information of a linear code and determine its performance in various applications, and have become one…
In this paper, we consider the use of lattice codes over Eisenstein integers for implementing a compute-and-forward protocol in wireless networks when channel state information is not available at the transmitter. We extend the…
Self-dual codes are important because many of the best codes known are of this type and they have a rich mathematical theory. Topics covered in this survey include codes over F_2, F_3, F_4, F_q, Z_4, Z_m, shadow codes, weight enumerators,…
Diameter perfect codes form a natural generalization for perfect codes. They are based on the code-anticode bound which generalizes the sphere-packing bound. The code-anticode bound was proved by Delsarte for distance-regular graphs and it…