Results 261 to 270 of about 87,508 (304)

A spatiotemporal dataset of farmland rent aligned with farming seasons across China 2021-2025. [PDF]

Sci Data
Xing Q, Zhu S, Zhu D, Wang J.
europepmc   +1 more source

On the Covering Radius of MDS Codes

IEEE Transactions on Information Theory, 2015
For a linear maximum distance separable (MDS) code with redundancy $r$ , the covering radius is either $r$ or $r-1$ . However, for $r>3$ , few examples of $q$ -ary linear MDS codes with radius $r-1$ are known, including the Reed–Solomon codes with length $q+1$ . In this paper, for redundancies $r$ as large as
Daniele Bartoli, Massimo Giulietti
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

A new construction for covering codes

IEEE Transactions on Information Theory, 1988
A novel method for constructing normal binary nonlinear covering codes is presented. The construction improves several upper bounds on K(n,R), the minimum cardinality of a binary code of length n and covering radius R. >
I S Honkala
exaly   +3 more sources

Covering codes with improved density

IEEE Transactions on Information Theory, 2003
We prove a general recursive inequality concerning /spl mu//sup */(R), the asymptotic (least) density of the best binary covering codes of radius R. In particular, this inequality implies that /spl mu//sup */(R)/spl les/e/spl middot/(RlogR+logR+loglogR+2), which significantly improves the best known density 2/sup R/R/sup R/(R+1)/R!. Our inequality also
Michael Krivelevich, Benny Sudakov, Van H. Vu   +2 more
exaly   +2 more sources

Covering Submonoids and Covering Codes

J. Autom. Lang. Comb., 1999
This paper deals with the formalization of the intuitive notion of covering monoid and the investigation of the related algebraic properties. It is shown that covering monoids can be regarded as a generalization of the well known classical monoids and z-monoids. A new coding notion is introduced and a simple method to decide whether a finite set $X$ of
MADONIA, Maria Serafina, SALEMI S, SPORTELLI T.   +2 more
openaire   +3 more sources

On Covering Problems of Codes

Theory of Computing Systems, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Moti Frances, Ami Litman
openaire   +2 more sources

Switching of covering codes

Discrete Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Östergård, Patric R.J., Weakley, William, D.   +2 more
openaire   +1 more source