Results 21 to 30 of about 560,164 (221)
Keynes is alive and well: a survey article
The article reviews "The Collected Writings of John Maynard Keynes", on occasion of the recently published paperback edition of the photostatic reprint. The original edition made available to scholars most of Keynes’s writings and important parts of his
Alessandro Roncaglia
doaj +1 more source
Generic constructions of PoRs from codes and instantiations
In this paper, we show how to construct – from any linear code – a Proof of Retrievability (𝖯𝗈𝖱{\mathsf{PoR}}) which features very low computation complexity on both the client (𝖵𝖾𝗋𝗂𝖿𝗂𝖾𝗋{\mathsf{Verifier}}) and the server (𝖯𝗋𝗈𝗏𝖾𝗋{\mathsf{Prover}}) sides,
Lavauzelle Julien +1 more
doaj +1 more source
Introduction. Polynomials in several variables over Galois fields provide the basis for the Reed-Muller coding theory, and are also used in a number of cryptographic problems.
V. M. Deundyak, N. S. Mogilevskaya
doaj +1 more source
Entrepreneurial University Agility Model with Knowledge Management Approach [PDF]
Today, attention to entrepreneurship is one of the important concerns of institutions and centers, including universities. University, as a living human system, needs agility to flourish and learn from changes, so that the change is a natural and ...
NoorMohammad Yaghoubi +2 more
doaj +1 more source
Code algebras, axial algebras and VOAs [PDF]
Inspired by code vertex operator algebras (VOAs) and their representation theory, we define code algebras, a new class of commutative non-associative algebras constructed from binary linear codes. Let $C$ be a binary linear code of length $n$.
Castillo-Ramirez, Alonso +2 more
core +3 more sources
The SMEFTsim package, theory and tools
We report codes for the Standard Model Effective Field Theory (SMEFT) in FeynRules — the SMEFTsim package. The codes enable theoretical predictions for dimension six operator corrections to the Standard Model using numerical tools, where predictions can ...
Ilaria Brivio, Yun Jiang, Michael Trott
doaj +1 more source
On the minimum distance of elliptic curve codes
Computing the minimum distance of a linear code is one of the fundamental problems in algorithmic coding theory. Vardy [14] showed that it is an \np-hard problem for general linear codes.
Li, Jiyou, Wan, Daqing, Zhang, Jun
core +1 more source
We illustrate how computer-aided methods can be used to investigate the fundamental limits of the caching systems, which are significantly different from the conventional analytical approach usually seen in the information theory literature.
Chao Tian
doaj +1 more source
Failure of Slender Concrete Columns Due to a Loss of Stability
The European standard for the design of concrete structures that are likely to lose stability requires taking into account the effects of second order theory.
Benko Vladimír +2 more
doaj +1 more source
We consider a two-unicast-$Z$ network over a directed acyclic graph of unit capacitated edges; the two-unicast-$Z$ network is a special case of two-unicast networks where one of the destinations has apriori side information of the unwanted (interfering ...
Cadambe, Viveck, Fahim, Mohammad
core +1 more source

