Results 41 to 50 of about 159,834 (164)
MathematicsWe 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
ColliderBit: a GAMBIT module for the calculation of high-energy collider observables and likelihoods
European Physical Journal C: Particles and Fields, 2017 We describe ColliderBit, a new code for the calculation of high energy collider observables in theories of physics beyond the Standard Model (BSM). ColliderBit features a generic interface to BSM models, a unique parallelised Monte Carlo event generation
The GAMBIT Scanner Workgroup: +15 more
doaj +1 more source
Bounds on covering codes with the rank metric [PDF]
IEEE Communications Letters, 2009 8 pages, 1 table, extended version with all the ...
Maximilien Gadouleau, Zhiyuan Yan 0001
openaire +2 more sources
Solving LPN Using Covering Codes [PDF]
Journal of Cryptology, 2014 Abstract We present a new algorithm for solving the LPN problem. The algorithm has a similar form as some previous methods, but includes a new key step that makes use of approximations of random words to a nearest codeword in a linear code. It outperforms previous methods for many parameter choices. In particular, we can now solve the $$(512,\frac{1}{8}
Qian Guo 0001 +2 more
openaire +4 more sources
New Generation Stability Norms – How to Approach the Task
Polish Maritime Research, 2018 International stability norms included in the Code of Intact Stability 2008 adopted by IMO on 4 December 2008 constitutes the latest set of international requirements on intact stability of ships.
Kobyliński Lech
doaj +1 more source
The Covering Radius of Group Codes
IEEE Transactions on Information TheoryGroup codes form an important class of spherical codes, consisting of a single orbit under a subgroup of the orthogonal group. They have been studied by (Mittelholzer-Lahtonen, 1996) in the case of Coxeter groups for their packing radius. We study them here for the same groups, with respect to their covering radius.
Minjia Shi +3 more
openaire +2 more sources
Legal Status of Women in Codes Binding in Central Polish Lands in the Early Nineteenth Century
Journal on European History of Law, 2020 The article describes the position of women pursuant to the codes adopted in the territories of contemporary Poland at the beginning of the nineteenth century (Allgemeines Landrecht für die Königlich Preussischen Staaten, Code civil des Français ...
Piotr Zbigniew Pomianowski
doaj +1 more source
De Bruijn cycles for covering codes [PDF]
Random Structures & Algorithms, 2004 AbstractA de Bruijn covering code is a q‐ary string S so that every q‐ary string is at most R symbol changes from some n‐word appearing consecutively in S. We introduce these codes and prove that they can have size close to the smallest possible covering code. The proof employs tools from field theory, probability, and linear algebra.
Fan R. K. Chung, Joshua N. Cooper
openaire +2 more sources
The Project that never Happened: Napoleon’s Military Code, 1805
Известия Уральского федерального университета. Серия 2: Гуманитарные науки, 2019 Covering the period from the Old Regime through the turmoil of the Revolution, Consulate, and early Napoleonic Empire, this article aims to examine and analyse the historical evolution of the government’s relationship with the armed forces, which ...
Eman M. Vovsi
doaj +1 more source
A Dataset Showing a Century of Evolution in the Complexity of the United States Legal Code
Scientific DataAs societies confront increasingly complex regulatory demands in domains such as digital governance, climate policy, and public health, there is a pressing need to understand how legal systems evolve, where they concentrate regulatory attention, and how ...
Dawoon Jeong +5 more
doaj +1 more source