Results 131 to 140 of about 159,834 (164)
Some of the next articles are maybe not open access.
On Lower Bounds For Covering Codes
Designs, Codes and Cryptography, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mahesh C. Bhandari +2 more
openaire +2 more sources
A new construction for covering codes
IEEE Transactions on Information Theory, 1988A 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. >
Iiro S. Honkala, Heikki O. Hämäläinen
openaire +2 more sources
Long packing and covering codes
IEEE Transactions on Information Theory, 1997Let \(C_i\), \(i=1,2,\dots\), denote an infinite family of binary codes with length \(n_i\) tending to infinity, covering radius \(R_i\), and minimum distance \(d_i\). Assume that the limits \(\rho\) and \(\delta\) for the ratios \(R_i/n_i\) and \(d_i/n_i\) exist. The authors study the set \(Y\) (respectively, \(Y_{\text{lin}})\) of possible values \((\
Gérard D. Cohen +3 more
openaire +1 more source
Linear codes with covering radius 2 and other new covering codes
IEEE Transactions on Information Theory, 1991Infinite families of linear binary codes with covering radius R=2 and minimum distance d=3 and d=4 are given. Using the constructed codes with d=3, R=2, families of covering codes with R>2 are obtained. The parameters of many constructed codes with R >
Ernst M. Gabidulin +2 more
openaire +1 more source
Sphere coverings and identifying codes
Designs, Codes and Cryptography, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David Auger +2 more
openaire +1 more source
New Constructions of Covering Codes
Designs, Codes and Cryptography, 2001Covering codes and their constructions and a general survey of covering problems are considered in [\textit{G. D. Cohen}, \textit{I. S. Honkala}, \textit{S. N. Litsyn} and \textit{A. C. Lobstein}, Covering Codes. North-Holland Math. Library. Vol. 54. Amsterdam: Elsevier (1997; Zbl 0874.94001)].
openaire +2 more sources
Covering codes with improved density
IEEE Transactions on Information Theory, 2003We 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 +2 more
openaire +1 more source
On the Covering Radius of MDS Codes
IEEE Transactions on Information Theory, 2015For 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
BARTOLI, DANIELE +2 more
openaire +1 more source
Constructing Covering Codes with Given Automorphisms
Designs, Codes and Cryptography, 1999The authors consider the problem of finding upper bounds on \(K(n,r)\), the minimum number of words in a binary code of length \(n\) and covering radius \(r\). Constructions of covering codes give these bounds on \(K(n,r)\). It is shown how computer searches for covering codes can be speed up by requiring that the code has a given (not necessarily full)
Patric R. J. Östergård +1 more
openaire +2 more sources
On the covering radius of convolutional codes
1994We consider a problem of calculating covering capabilities for convolutional codes. An upper bound on covering radius for convolutional code is obtained by random coding arguments. The estimates on covering radius for some codes with small constraint length are presented.
Irina E. Bocharova, Boris D. Kudryashov
openaire +1 more source