Results 41 to 50 of about 87,508 (304)

Error-Correcting Codes from k-Resolving Sets

open access: yesDiscussiones Mathematicae Graph Theory, 2019
We demonstrate a construction of error-correcting codes from graphs by means of k-resolving sets, and present a decoding algorithm which makes use of covering designs.
Bailey Robert F., Yero Ismael G.
doaj   +1 more source

Complex Cases of Source Code Authorship Identification Using a Hybrid Deep Neural Network

open access: yesFuture Internet, 2022
This paper is a continuation of our previous work on solving source code authorship identification problems. The analysis of heterogeneous source code is a relevant issue for copyright protection in commercial software development. This is related to the
Anna Kurtukova   +3 more
doaj   +1 more source

How to Find the Covering Radius of Linear Codes over Finite Fields Using a Parity-Check Matrix in Parallel

open access: yesMathematics
We present a parallel algorithm for computing the covering radius of a linear [n,k]q code using its parity-check matrix. The method is based on the systematic generation of syndromes associated with linear combinations of columns of the parity-check ...
Iliya Bouyukliev   +2 more
doaj   +1 more source

Covering bounds for codes

open access: yesJournal of Combinatorial Theory, Series A, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

A Bibliometric Analysis of Publications in Uremic Toxins From 1991 to 2024

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Background Uremic toxins are a growing area of research in nephrology, with significant implications in the progression and treatment of chronic kidney disease (CKD) and the management of end‐stage kidney disease (ESKD). This bibliometric analysis aims to evaluate the global research trends, key contributors, and the impact of publications in ...
Yuh‐Shan Ho   +7 more
wiley   +1 more source

On the upper bound of the size of the r-cover-free families

open access: yes, 1994
Let T (r; n) denote the maximum number of subsets of an n-set satisfying the condition in the title. It is proved in a purely combinatorial way, that for n sufficiently large log 2 T (r; n) n 8 \Delta log 2 r r 2 holds. 1.
Miklós Ruszinko, Ruszinkó, Miklós
core   +1 more source

Protein pyrophosphorylation by inositol pyrophosphates — detection, function, and regulation

open access: yesFEBS Letters, EarlyView.
Protein pyrophosphorylation is an unusual signaling mechanism that was discovered two decades ago. It can be driven by inositol pyrophosphate messengers and influences various cellular processes. Herein, we summarize the research progress and challenges of this field, covering pathways found to be regulated by this posttranslational modification as ...
Sarah Lampe   +3 more
wiley   +1 more source

Low-density parity-check codes and their rateless relatives

open access: yes, 2011
This survey guides the reader through the extensive open literature that is covering the family of low-density parity-check LDPC codes and their rateless relatives.
Sheng Chen   +5 more
core   +1 more source

Application of Best Estimate Approach for Modelling of QUENCH-03 and QUENCH-06 Experiments

open access: yesNuclear Engineering and Technology, 2016
One of the important severe accident management measures in the Light Water Reactors is water injection to the reactor core. The related phenomena are investigated by performing experiments and computer simulations.
Tadas Kaliatka   +2 more
doaj   +1 more source

[Des]cubrirse. La simbología del continente americano en las representaciones femeninas del siglo XVI en los libros de trajes

open access: yesCahiers d’études des cultures ibériques et latino-américaines, 2021
Costume books, as Renaissance sources, manifest specific representation codes, inside a patriarchal, androcentric and eurocentric view. Depictions on the American continent can be interpreted through the concept of [dis]covering as a double entendre ...
Rebeca García Haro
doaj   +1 more source

Home - About - Disclaimer - Privacy