Results 21 to 30 of about 563,161 (224)
Advanced Engineering Research, 2018 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
Message passing algorithms for non-linear nodes and data compression [PDF]
, 2005 The use of parity-check gates in information theory has proved to be very efficient. In particular, error correcting codes based on parity checks over low-density graphs show excellent performances.
Ciliberti, S., Mezard, M., Zecchina, R.
core +2 more sources
Entrepreneurial University Agility Model with Knowledge Management Approach [PDF]
پژوهشهای مدیریت عمومی, 2019 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
The SMEFTsim package, theory and tools
Journal of High Energy Physics, 2017 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
, 2015 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
Entropy, 2018 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
Slovak Journal of Civil Engineering, 2019 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
Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard
, 2004 Maximum-likelihood decoding is one of the central algorithmic problems in coding theory. It has been known for over 25 years that maximum-likelihood decoding of general linear codes is NP-hard.
Guruswami, Venkatesan, Vardy, Alexander
core +2 more sources
Code algebras, axial algebras and VOAs [PDF]
, 2018 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
, 2018 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