Results 21 to 30 of about 764,565 (289)
Optimal Locally Repairable Codes via Rank-Metric Codes
, 2013 This paper presents a new explicit construction for locally repairable codes (LRCs) for distributed storage systems which possess all-symbols locality and maximal possible minimum distance, or equivalently, can tolerate the maximal number of node ...
Koyluoglu, O. Ozan +3 more
core +1 more source
Optimal Population Coding, Revisited [PDF]
, 2011 Cortical circuits perform the computations underlying rapid perceptual decisions within a few dozen milliseconds with each neuron emitting only a few spikes.
Alexander S. Ecker +4 more
core +2 more sources
MDS Array Codes with Optimal Rebuilding [PDF]
, 2011 MDS array codes are widely used in storage systems to protect data against erasures. We address the rebuilding ratio problem, namely, in the case of erasures, what is the the fraction of the remaining information that needs to be accessed in order to
Bruck, Jehoshua +2 more
core +3 more sources
Code selection through object code optimization [PDF]
ACM Transactions on Programming Languages and Systems, 1984 Cet article montre comment une optimisation de code objet minutieux a simplifiee un compilateur et la rendu facile a recibler.
Jack W. Davidson, Christopher W. Fraser
openaire +1 more source
On Codes for Optimal Rebuilding Access [PDF]
, 2011 MDS (maximum distance separable) array codes are widely used in storage systems due to their computationally efficient encoding and decoding procedures.
Bruck, Jehoshua +2 more
core +4 more sources
New Optimal Constant Weight Codes [PDF]
The Electronic Journal of Combinatorics, 2007 In 2006, Smith et al. published a new table of constant weight codes, updating existing tables originally created by Brouwer et al. This paper improves upon these results by filling in 9 missing constant weight codes, all of which are optimal by the second Johnson bound.
Gashkov, I., Taub, D.
openaire +2 more sources
On Tight Optimal Conflict-Avoiding Codes for 3, 4, 5 and 6 Active Users
Cybernetics and Information Technologies, 2018 We classify tight optimal conflict-avoiding codes of weights 3, 4, 5 and 6 and given small lengths.
Baicheva Tsonka, Topalova Svetlana
doaj +1 more source
Construction of a Class of Real Array Rank Distance Codes
Journal of Electrical and Computer Engineering, 2023 Rank distance codes are known to be applicable in various applications such as distributed data storage, cryptography, space time coding, and mainly in network coding.
N. Suresh Babu +3 more
doaj +1 more source
Construction of isodual codes from polycirculant matrices
, 2020 Double polycirculant codes are introduced here as a generalization of double circulant codes. When the matrix of the polyshift is a companion matrix of a trinomial, we show that such a code is isodual, hence formally self-dual.
Shi, Minjia, Sole, Patrick, Xu, Li
core +3 more sources
Optimal Smoothing for N-Body Codes [PDF]
, 1995 In any collisionless N-body code, there is an optimal choice for the smoothing parameter that minimizes the average error in the force evaluations. We show how to compute the optimal softening length in a direct-summation code and demonstrate that it ...
Merritt, David
core +3 more sources