Related papers: New Inequalities for q-ary Constant-Weight Codes
We improve on the lower bound of the maximum number of planes of ${\rm PG}(8,q)$ mutually intersecting in at most one point leading to the following lower bound: ${\cal A}_q(9, 4; 3) \ge q^{12}+2q^8+2q^7+q^6+q^5+q^4+1$ for constant…
This paper presents conditions for constructing permutation-invariant quantum codes for deletion errors and provides a method for constructing them. Our codes give the first example of quantum codes that can correct two or more deletion…
Applying methods of Real Analysis and Functional Analysis, we build two weight functions with parameters and provide two kinds of parameterized Yang-Hilbert-type integral inequalities with the best constant factors. Equivalent forms, the…
We study, in this paper, a one parameter deformation of the $q-$Laguerre weight function. An investigation is made on the polynomials orthogonal with respect to such a weight. With the aid of the two compatibility conditions previously…
A family of $\omega$-circulant balanced weighing matrices with classical parameters is used for the construction of optimal constant weight codes over an alphabet of size $g+1$ and length $n=(q^m -1)/(q-1)$, where $q$ is an odd prime power,…
We derive an efficient CH-type inequality. Quantum mechanics violates our proposed inequality independent of the detection-efficiency problem.
Independent parallel q-ary symmetric channels are a suitable transmission model for several applications. The proposed weighted-Hamming metric is tailored to this setting and enables optimal decoding performance. We show that some…
We investigate isoperimetric constants of infinite tessellating metric graphs. We introduce a curvature-like quantity, which plays the role of a metric graph analogue of discrete curvature notions for combinatorial tessellating graphs. We…
Self-orthogonal codes are a significant class of linear codes in coding theory and have attracted a lot of attention. In \cite{HLL2023Te,LH2023Se}, $p$-ary self-orthogonal codes were constructed by using $p$-ary weakly regular bent…
A basic problem for constant dimension codes is to determine the maximum possible size $A_q(n,d;k)$ of a set of $k$-dimensional subspaces in $\mathbb{F}_q^n$, called codewords, such that the subspace distance satisfies…
Linear codes with a few weights can be applied to communication, consumer electronics and data storage system. In addition, the weight hierarchy of linear codes has many applications such as on the type II wire-tap channel, dealing with…
We study the higher order q- Poincar\'e and other coercive inequalities for a class probability measures satisfying Adam's regularity condition.
Based on cyclic and consta-cyclic simplex codes, a new explicit construction of a family of two-weight codes is presented. These two-weight codes obtained are in the form of 2-generator quasi-cyclic, or quasi-twisted structure. Based on…
We study q-ary linear codes C obtained from Veronese surfaces over finite fields. We show how one can find the higher weight spectra of these codes, or equivalently, the weight distribution of all extension codes of C over all field…
This paper aims to characterize the function appearing in the weighted Hermite-Hadamard inequality. We provide improved inequalities for the weighted means as applications of the obtained results. Modifications of the weighted…
The problem of correcting transpositions (or swaps) of consecutive symbols in $ q $-ary strings is studied. Lower bounds on asymptotically achievable rates of codes correcting $ t = \tau n $ transpositions are derived. The first bound is…
The weight hierarchy of a linear code has been an important research topic in coding theory since Wei's original work in 1991. Choosing $ D=\Big\{(x,y)\in \Big(\F_{p^{s_1}}\times\F_{p^{s_2}}\Big)\Big\backslash\{(0,0)\}: f(x)+g(y)=0\Big\}$…
Using proof-theoretic methods in the style of proof mining, we give novel computationally effective limit theorems for the convergence of the Cesaro-means of certain sequences of random variables. These results are intimately related to…
In this paper, we will prove several new inequalities of Hardy's types with explicit constants. The main results will be proved by making use of some generalizations of Opial's type inequalities and H\"older's inequality. To the best of the…
A $q$-ary code $C$ of length $n$ is a set of $n$-dimensional vectors (code words) with entries in $\{0, \ldots, q-1\}$. We say $C$ has constant weight $w$ if each code word has exactly $w$ nonzero entries. We say $C$ has minimum distance…