相关论文: Asymmetric binary covering codes

The purpose of this paper is two-fold. First, we characterize the existence of binary self-orthogonal codes meeting the Griesmer bound by employing Solomon-Stiffler codes and some related residual codes. Second, using such a…

The smallest possible length of a $q$-ary linear code of covering radius $R$ and codimension (redundancy) $r$ is called the length function and is denoted by $\ell_q(r,R)$. In this work, for $q$ \emph{an arbitrary prime power}, we obtain…

For which positive integers $n,k,r$ does there exist a linear $[n,k]$ code $C$ over $\mathbb{F}_q$ with all codeword weights divisible by $q^r$ and such that the columns of a generating matrix of $C$ are projectively distinct? The…

In this paper, we construct an infinite family of three-weight binary codes from linear codes over the ring $R=\mathbb{F}_2+v\mathbb{F}_2+v^2\mathbb{F}_2$, where $v^3=1.$ These codes are defined as trace codes. They have the algebraic…

The error coefficient of a linear code is defined as the number of minimum-weight codewords. In an additive white Gaussian noise channel, optimal linear codes with the smallest error coefficients achieve the best possible asymptotic frame…

We introduce Berman-intersection-dual Berman (BiD) codes. These are abelian codes of length $3^m$ that can be constructed using Kronecker products of a $3 \times 3$ kernel matrix. BiD codes offer minimum distance close to that of…

The AWGNC, BSC, and max-fractional pseudocodeword redundancies of a binary linear code are defined to be the smallest number of rows in a parity-check matrix such that the corresponding minimum pseudoweight is equal to the minimum Hamming…

Subspace codes have important applications in random network coding. It is interesting to construct subspace codes with both sizes, and the minimum distances are as large as possible. In particular, cyclic constant dimension subspaces codes…

Given two 3-uniform hypergraphs F and G, we say that G has an F-covering if we can cover V(G) by copies of F. The minimum codegree of G is the largest integer d such that every pair of vertices from V(G) is contained in at least d triples…

The balanced double star on $2n+2$ vertices, denoted $S_{n,n}$, is the tree obtained by joining the centers of two disjoint stars each having $n$ leaves. Let $R_r(G)$ be the smallest integer $N$ such that in every $r$-coloring of the edges…

Asymmetric quantum error-correcting codes (AQCs) may offer some advantage over their symmetric counterparts by providing better error-correction for the more frequent error types. The well-known CSS construction of $q$-ary AQCs is extended…

We consider the problem of encoding range minimum queries (RMQs): given an array A[1..n] of distinct totally ordered values, to pre-process A and create a data structure that can answer the query RMQ(i,j), which returns the index containing…

Let $A_2(n,d)$ be the maximum size of a binary code of length $n$ and minimum distance $d$. In this paper we present the following new lower bounds: $A_2(18,4) \ge 5632$, $A_2(21,4) \ge 40960$, $A_2(22,4) \ge 81920$, $A_2(23,4) \ge 163840$,…

A locally repairable code with availability has the property that every code symbol can be recovered from multiple, disjoint subsets of other symbols of small size. In particular, a code symbol is said to have $(r,t)$-availability if it can…

In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…

In this paper we extend to asymmetric quantum error-correcting codes (AQECC) the construction methods, namely: puncturing, extending, expanding, direct sum and the (u|u + v) construction. By applying these methods, several families of…

Let $n\geq 2$ be any integer. We study the optimal lower bound $v_{n, n-i}$ of the canonical volume and the optimal upper bound $r_{n,n-i}$ of the canonical stability index for minimal projective $n$-folds of general type, which are…

Let $X_1,X_2, \ldots $ and $Y_1, Y_2, \ldots$ be i.i.d. random uniform points in a bounded domain $A \subset \mathbb{R}^2$ with smooth or polygonal boundary. Given $n,m,k \in \mathbb{N}$, define the {\em two-sample $k$-coverage threshold}…

We address the maximum size of binary codes and binary constant weight codes with few distances. Previous works established a number of bounds for these quantities as well as the exact values for a range of small code lengths. As our main…

Completely regular codes with covering radius $\rho=1$ must have minimum distance $d\leq 3$. For $d=3$, such codes are perfect and their parameters are well known. In this paper, the cases $d=1$ and $d=2$ are studied and completely…