相关论文: On Zero Skip-Cost Generalized Fractional-Repetitio…
A design method for chromatic dispersion compensation filters realized using overlap-save processing in the frequency domain is proposed. Based on the idea to use the values that are normally zero-padded, better results than using optimal…
Using fault-tolerant constructions, computations performed with unreliable components can simulate their noiseless counterparts though the introduction of a modest amount of redundancy. Given the modest overhead required to achieve…
Unreplicated two-level factorial designs are often used in screening experiments to determine which factors out of a large plausible set are active. A theorem regarding the generalized word count pattern is stated and proved for…
In this paper, we exploit the theory of dense graph limits to provide a new framework to study the stability of graph partitioning methods, which we call structural consistency. Both stability under perturbation as well as asymptotic…
Data shaping is a coding technique that has been proposed to increase the lifetime of flash memory devices. Several data shaping codes have been described in recent work, including endurance codes and direct shaping codes for structured…
Storage codes are used to ensure reliable storage of data in distributed systems. Here we consider functional repair codes, where individual storage nodes that fail may be repaired efficiently and the ability to recover original data and to…
The joint use of counting functions, Hilbert basis and Markov basis allows to define a procedure to generate all the fractions that satisfy a given set of constraints in terms of orthogonality. The general case of mixed level designs,…
The study of good nonregular fractional factorial designs has received significant attention over the last two decades. Recent research indicates that designs constructed from quaternary codes (QC) are very promising in this regard. The…
We extend coded distributed computing over finite fields to allow the number of workers to be larger than the field size. We give codes that work for fully general matrix multiplication and show that in this case we serendipitously have…
Dependently typed languages are well known for having a problem with code reuse. Traditional non-indexed algebraic datatypes (e.g. lists) appear alongside a plethora of indexed variations (e.g. vectors). Functions are often rewritten for…
The explosion in the volumes of data being stored online has resulted in distributed storage systems transitioning to erasure coding based schemes. Yet, the codes being deployed in practice are fairly short. In this work, we address what we…
We construct an example of an iterated function system on the line, consisting of linear fractional transformations, such that two of the maps share a fixed points, but the dimension of the attractor equals the conformal dimension, so that…
For a Distributed Storage System (DSS), the \textit{Fractional Repetition} (FR) code is a class in which replicas of encoded data packets are stored on distributed chunk servers, where the encoding is done using the Maximum Distance…
The concept of group divisible codes, a generalization of group divisible designs with constant block size, is introduced in this paper. This new class of codes is shown to be useful in recursive constructions for constant-weight and…
In the context of distributed storage systems, locally repairable codes have become important. In this paper we focus on codes that allow for multi-erasure pattern decoding with low computational effort. Different optimality requirements,…
We give a method of constructing a cover-free $(s, \ell)$-code. For $k > s$, our construction yields a $ {{n \choose s} \choose \ell}\times {n \choose k}$ cover-free $(s, \ell)$-code with a constant column weight.
In this paper, we propose a class of threshold secret sharing schemes with repairing function between shares without the help of the dealer, that we called repairable threshold secret sharing schemes. Specifically, if a share fails, such as…
We study possible smooth deformations of Generalized Free Conformal Field Theories in arbitrary dimensions by exploiting the singularity structure of the conformal blocks dictated by the null states. We derive in this way, at the first non…
A cross-bifix-free code is a set of words in which no prefix of any length of any word is the suffix of any word in the set. Cross-bifix-free codes arise in the study of distributed sequences for frame synchronization. We provide a new…
Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peer-to-peer storage systems, and storage in wireless networks. Storing…