Results 251 to 260 of about 51,101 (296)
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
BARTOLI, DANIELE +2 more
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Applicable Algebra in Engineering, Communications and Computing, 1997
The covering radius of a code is the maximum distance of any vector in the ambient space to the code. The authors give a summary of many works on covering codes during the period 1985-1994 that have appeared since an earlier survey [\textit{G. D. Cohen}, \textit{M. G. Karpovsky}, \textit{H. F. Mattson} jun. and \textit{J. R. Schatz}, IEEE Trans.
Cohen, G. D. +3 more
exaly +3 more sources
The covering radius of a code is the maximum distance of any vector in the ambient space to the code. The authors give a summary of many works on covering codes during the period 1985-1994 that have appeared since an earlier survey [\textit{G. D. Cohen}, \textit{M. G. Karpovsky}, \textit{H. F. Mattson} jun. and \textit{J. R. Schatz}, IEEE Trans.
Cohen, G. D. +3 more
exaly +3 more sources
Covering radius and dual distance
Designs, Codes, and Cryptography, 1991zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A Tietäväinen
exaly +2 more sources
The covering radius of PGL(3,q)
Discrete Mathematics, 2019 In this note, with a purely geometric approach, the covering radius of the group PGL(3, q) is determined. Also, a new proof establishing the covering radii of PGL(2, q) and AGL(1, q) is provided.
Antonio Cossidente +2 more
exaly +2 more sources
On the covering radius of codes
IEEE Transactions on Information Theory, 1985A number of new results for the minimum covering radius of any binary code of a given length and dimension are given. The minimum covering radius for codes of dimension 4 or 5 is determined exactly, and tight bounds are obtained for any dimension when the code length is large.
Ronald L. Graham, Neil J. A. Sloane
openaire +1 more source
On Covering Radius of Orthogonal Arrays
2020 Algebraic and Combinatorial Coding Theory (ACCT), 2020We obtain analytically upper bounds for the covering radius of orthogonal arrays (OAs) by investigations of the set of all feasible distance distributions of the corresponding OAs. We apply a procedure for reduction of the possible distance distributions of OA to improve the bound by 1 under certain assumptions.
Silvia P. Boumova +2 more
openaire +1 more source
New bounds on the covering radius of the second order Reed-Muller code of length 128 [PDF]
Cryptography and Communications, 2018 In 1981, Schatz proved that the covering radius of the binary Reed- Muller code RM (2, 6) is 18. It was previously shown that the covering radius of RM(2,7) is between 40 and 44.
Qichun Wang +2 more
exaly +2 more sources
Covering Radius of Matrix Codes Endowed with the Rank Metric
SIAM Journal on Discrete Mathematics, 2017 In this paper we study properties and invariants of matrix codes endowed with the rank metric and relate them to the covering radius. We introduce new tools for the analysis of rank-metric codes, such as puncturing and shortening constructions.
Eimear Byrne, Alberto Ravagnani
exaly +3 more sources
The variable radius covering problem
European Journal of Operational Research, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oded Berman +3 more
openaire +2 more sources