Results 31 to 40 of about 30,579 (293)
An Experiment in Interoperable Cryptographic Protocol Implementation Using Automatic Code Generation [PDF]
, 2007 Spi2Java is a tool that enables semi-automatic generation of cryptographic protocol implementations, starting from verified formal models. This paper shows how the last version of spi2Java has been enhanced in order to enable interoperability of the ...
Pironti, Alfredo +3 more
core +1 more source
LESS-FM: Fine-Tuning Signatures from the Code Equivalence Problem [PDF]
, 2021 Code-based cryptographic schemes are highly regarded among the quantum-safe alternatives to current standards. Yet, designing code-based signatures using traditional methods has always been a challenging task, and current proposals are still far from the
Edoardo Persichetti +4 more
core +3 more sources
Asserting Functional Equivalence between C Code and SCADE Models in Code-to-Model Transformations [PDF]
, 2020 Video presentation of the SAST@CBSoft'20 paper 'Asserting Functional Equivalence between C Code and SCADE Models in Code-to-Model Transformations'
Jan Toennemann
core +1 more source
Equivalence Checking of Scheduling in High-Level Synthesis Using Deep State Sequences
IEEE Access, 2019 By using high-level synthesis tools, electronic system level design provides a promising solution to fill the growing design productivity gap of high quality hardware systems.
Jian Hu +3 more
doaj +1 more source
On linear equivalence and Phelps codes
Advances in Mathematics of Communications, 2010 It is shown that all non-full-rank FRH-codes, a class of perfect codes we define in this paper, are linearly equivalent to perfect codes obtainable by Phelps' construction. Moreover, it is shown by an example that the class of perfect FRH-codes also contains perfect codes that are not obtainable by Phelps construction.
Olof Heden, Martin Hessler
openaire +1 more source
The Hardness of Code Equivalence over $\mathbf{F}_q$ and its Application to Code-based Cryptography [PDF]
, 2013 International audienceThe code equivalence problem is to decide whether two linear codes over F_q are equivalent, that is identical up to a linear isometry of the Hamming space.
Dimitris E. Simos +3 more
core +2 more sources
La narrativa de código mixto de Cisneros y sus implicaciones para la traducción
Mutatis Mutandis, 2008 Las consecuencias pragmáticas de la alternancia de código en el campo de la traducción literaria han sido poco estudiadas, especialmente en el caso de las novelas chicanas escritas en inglés, pero que alternan al español por razones estilísticas ...
María José García Vizcaíno
doaj +1 more source
BMC Medical Research Methodology, 2020 Background Cross-cultural research with patient-reported outcomes measures (PROMs) assumes that the PROM in the target language will measure the same construct in the same way as the PROM in the source language. Yet translation methods are rarely used to
Melanie Hawkins +3 more
doaj +1 more source
On the Equivalence of NMDS Codes
IEEE Transactions on Information TheoryAn $[n,k,d]$ linear code is said to be maximum distance separable (MDS) or almost maximum distance separable (AMDS) if $d=n-k+1$ or $d=n-k$, respectively. If a code and its dual code are both AMDS, then the code is said to be near maximum distance separable (NMDS).
Jianbing Lu, Yue Zhou 0001
openaire +2 more sources
Investigating the Refactoring Capabilities of Small Open-Weight Language Models
SoftwareRefactoring is essential for developing maintainable software. Using Large Language Models in software engineering is widespread, but compared to well-established domains such as code generation, reliable refactoring is still relatively underexplored. In
Tamás Márton +3 more
doaj +1 more source