Results 1 to 10 of about 51,101 (296)
Covering radius for sets of permutations
Discrete Mathematics, 2005 The authors study the covering radius of sets of permutations with respect to the Hamming distance. In particular, they define \(f(n,s)\) to be the smallest integer \(m\) for which there is a set of \(m\) permutations in \(S_n\) with covering radius \(r \leq n-s\).
Peter J Cameron, Ian M Wanless
exaly +3 more sources
Covering Radius of Melas Codes [PDF]
IEEE Transactions on Information Theory, 2022 We prove that the covering radius of the Melas code M (m, q) of length n = q m − 1 over Fq is 2 if q > 3. We also prove that the covering radius of M (m, 3) is 3 is m ≥ 3, the covering radius of M (2, 3) is 4, and the covering radii of M (1, 2) and M (1, 3) are 1.
Minjia Shi +3 more
core +6 more sources
On the Covering Radius of Codes over Zpk
Mathematics, 2020 In this correspondence, we investigate the covering radius of various types of repetition codes over Z p k ( k ≥ 2 ) with respect to the Lee distance.
Mohan Cruz +2 more
doaj +2 more sources
On the Covering Radius Problem for Codes I. Bounds on Normalized Covering Radius [PDF]
SIAM Journal on Algebraic and Discrete Methods, 1987 This article is reviewed together with the following one (see Zbl 0643.94021).
Kilby, Karen E., Sloane, N. J. A.
exaly +3 more sources
On the covering radius of some modular codes
Advances in Mathematics of Communications, 2014 This paper gives lower and upper bounds on the covering radius of codes over $\Z_{2^s}$ with respect to homogenous distance. We also determine the covering radius of various Repetition codes, Simplex codes (Type $α$ and Type $β$) and their dual and give bounds on the covering radii for MacDonald codes of both types over $\Z_4$.
Manish K Gupta, C Durairajan
exaly +3 more sources
On Codes Over R and its Bounds of Some kind of Block Repetition Codes in R
InPrime, 2022 This correspondence determines the lower and upper bounds of the covering radius in some kind of block repetition codes over the finite ring R=Z_2 Z_*, where Z_*=Z_2+vZ_2+v^2 Z_2, v^3=v.
P Chella Pandian
doaj +1 more source
Efficient Neighborhood Covering Model Based on Triangle Inequality Checkand Local Strategy [PDF]
Jisuanji kexue, 2022 Neighborhood covering model is widely used in classification tasks for its simple mechanism and ability to handle complex data.However,the neighborhood covering model has the problem of low efficiency and lack of related research work.To solve this ...
CHEN Yu-si, AI Zhi-hua, ZHANG Qing-hua
doaj +1 more source
Uniform approximation by polynomials with integer coefficients [PDF]
Opuscula Mathematica, 2016 Let \(r\), \(n\) be positive integers with \(n\ge 6r\). Let \(P\) be a polynomial of degree at most \(n\) on \([0,1]\) with real coefficients, such that \(P^{(k)}(0)/k!\) and \(P^{(k)}(1)/k!\) are integers for \(k=0,\dots,r-1\).
Artur Lipnicki
doaj +1 more source
Bounds on Covering Radius of Some Codes Over F₂ + uF₂ + vF₂ + uvF₂
IEEE Access, 2021 Let $R=\mathbb {F}_{2}+u\mathbb {F}_{2}+v\mathbb {F}_{2}+uv\mathbb {F}_{2}$ be a finite non-chain ring, where $u^{2}=u$ , $v^{2}=v$ , $uv=vu$ . We give the lower and upper bounds on the covering radius of different types of repetition codes for ...
Fanghui Ma, Jian Gao
doaj +1 more source
Competitive Swarm Optimizer Based Gateway Deployment Algorithm in Cyber-Physical Systems
Sensors, 2017 Wireless sensor network topology optimization is a highly important issue, and topology control through node selection can improve the efficiency of data forwarding, while saving energy and prolonging lifetime of the network.
Shuqiang Huang, Ming Tao
doaj +1 more source