Results 101 to 110 of about 51,101 (296)
All binary codes with covering radius one are subnormal
We prove that if a binary code has covering radius one then it is ...
Honkala, Iiro
core +1 more source
Laser‐Induced Graphene from Waste Almond Shells
Almond shells, an abundant agricultural by‐product, are repurposed to create a fully bioderived almond shell/chitosan composite (ASC) degradable in soil. ASC is converted into laser‐induced graphene (LIG) by laser scribing and proposed as a substrate for transient electronics.
Yulia Steksova +9 more
wiley +1 more source
A new approach to the covering radius of codes
We introduce a new approach which facilitates the calculation of the covering radius of a binary linear code. It is based on determining the normalized covering radius ϱ.
Sloane, N.J.A
core +1 more source
On the covering radius of Reed—Solomon codes
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Multianalyte, real‐time monitoring of bioprinted scaffolds remains challenging. Phosphorescence‐lifetime–based, optically responsive microparticles are embedded in diverse printable hydrogels (κ‐carrageenan, GelMA, PEGDA) to form biomaterial inks that report oxygen, glucose, lactate, and temperature.
Waqas Saleem +11 more
wiley +1 more source
The covering radius of Hadamard codes in odd graphs
The use of odd graphs has been proposed as fault-tolerant interconnection networks. The following problem originated in their design: what is the graphical covering radius of an Hadamard code of length 2k − 1 and size 2k − 1 in the odd graph Ok?
Ghafoor, Arif +2 more
core +1 more source
In MOCVD MoS2 memristors, a current compliance‐regulated Ag filament mechanism is revealed. The filament ruptures spontaneously during volatile switching, while subsequent growth proceeds vertically through the MoS2 layers and then laterally along the van der Waals gaps during nonvolatile switching.
Yuan Fa +19 more
wiley +1 more source
Covering radius for sets of permutations
We study the covering radius of sets of permutations with respect to the Hamming distance. Let f(n, s) be the smallest number m for which there is a set of m permutations in Sn with covering radius r ≤ n − s. We study f(n, s) in the general case and also
Ian M. Wanless B, Peter J. Cameron A
core
We present a study of O vi -bearing gas around 247 low-mass (median ${\mathrm{log}}_{10}({M}_{\star }/{M}_{\odot })$ = 8.7) galaxies at low redshifts (0.1 < z < 0.7) using background quasars as part of the MUSE Quasar-fields Blind Emitters Survey ...
Sayak Dutta +6 more
doaj +1 more source
Landslides on the Ende - Wolowaru road, Ende Regency often occur every year, especially in the rainy season. Therefore, research was carried out to determine the level of vulnerability to landslides on the Ende - Wolowaru road section, Ende Regency ...
Maria Sonya Kae +2 more
doaj +1 more source

