Related papers: New Inequalities for q-ary Constant-Weight Codes
Binary constant-weight codes have been extensively studied, due to both their numerous applications and to their theoretical significance. In particular, constant-weight codes have been proposed for error correction in store and forward. In…
We introduce two notions of discrepancy between binary vectors, which are not metric functions in general but nonetheless capture the mathematical structure of the binary asymmetric channel. In turn, these lead to two new fundamental…
We compute the best constants in some second order dilation invariant inequalities, with weights being powers of the distance from the origin.
In this paper, we generalize the method of using two parallel versions of the lifted MRD code from the existing work [1]. The Delsarte theorem of the rank distribution of MRD codes is an important part to count codewords in our…
This paper studies coding schemes for the $q$-ary symmetric channel based on binary low-density parity-check (LDPC) codes that work for any alphabet size $q=2^m$, $m\in\mathbb{N}$, thus complementing some recently proposed packet-based…
The paper deals with the perfect 1-error correcting codes over a finite field with $q$ elements (briefly $q$-ary 1-perfect codes). We show that the orthogonal code to the $q$-ary non-full-rank 1-perfect code of length $n = (q^{m}-1)/(q-1)$…
A basic problem for the constant dimension subspace coding is to determine the maximal possible size A_q (n, d, k) of a set of k-dimensional subspaces in Fnq such that the subspace distance satisfies d(U, V )> or =d for any two different…
We explore the uncertainty relation for unitary operators in a new way and find two uncertainty equalities for unitary operators, which are minimized by any pure states. Additionally, we derive two sets of uncertainty inequalities that…
We present a constraint-coding scheme to correct asymmetric magnitude-$1$ errors in multi-level non-volatile memories. For large numbers of such errors, the scheme is shown to deliver better correction capability compared to known…
We study the interplay between the lattice of F_{q^m}-subspaces and the lattice of F_{q^m}-subspaces of an F_{q^m}-vector space. Introducing notions of weight and defect relative to an F_q-subspace, we analyze the sequence of maximum…
We present new generalizations of Cauchy-Schwarz (CS) inequalities to multiple vectors and use them to derive multi-operator quantum uncertainty relations and propose multi-operator squeezing.
We study certain double--series inequalities, which are motivated by weighted Hardy inequalities.
The method of using rearrangements to give sufficient conditions for Fourier inequalities between weighted Lebesgue spaces is revisited. New results in the case q < p are established and a comparison between two known sufficient conditions…
This article is a continuation of our recent work (Yin Chen and Runxuan Zhang, Shape enumerators of self-dual NRT codes over finite fields. SIAM J. Discrete Math. 38 (2024), no. 4, 2841-2854) in the setting of quantum error-correcting…
The interest in $q$-analogs of codes and designs has been increased in the last few years as a consequence of their new application in error-correction for random network coding. There are many interesting theoretical, algebraic, and…
Quantum low-density parity-check (qLDPC) codes can be implemented by measuring only low-weight checks, making them compatible with noisy quantum hardware and central to the quest to build noise-resilient quantum computers. A fundamental…
In this paper we study generalized weights as an algebraic invariant of a code. We first describe anticodes in the Hamming and in the rank metric, proving in particular that optimal anticodes in the rank metric coincide with…
We establish a quantitative weighted inequality for the bilinear rough singular integral, where the bound is controlled by the cube of the weight constant.
A new construction for constant weight codes is presented. The codes are constructed from $k$-dimensional subspaces of the vector space $\F_q^n$. These subspaces form a constant dimension code in the Grassmannian space $\cG_q(n,k)$. Some of…
The growing amount of data available in modern-day datasets makes the need to efficiently search and retrieve information. To make large-scale search feasible, Distance Estimation and Subset Indexing are the main approaches. Although binary…