Related papers: Hierarchical Locally Recoverable Codes on surfaces
We classify elliptic fibrations birational to a nonsingular, minimal cubic surface over a field of characteristic zero. Our proof is adapted to provide computational techniques for the analysis of such fibrations, and we describe an…
Various types of recovery algorithms for batch codes have been investigated, such as asynchronous recovery or recovery as afforded by batch codes obtained from Almost Affinely Disjoint (AAD) families. In this paper, we offer the first…
Locally recoverable codes (LRCs) with locality parameter $r$ can recover any erased code symbol by accessing $r$ other code symbols. This local recovery property is of great interest in large-scale distributed classical data storage systems…
We study the Singleton-type bound that provides an upper limit on the minimum distance of locally repairable codes. We present an improved bound by carefully analyzing the combinatorial structure of the repair sets. Thus, we show the…
We consider fibrations by affine lines on smooth affine surfaces obtained as complements of smooth rational curves $B$ in smooth projective surfaces $X$ defined over an algebraically closed field of characteristic zero. We observe that…
Almost universally in computer vision, when surface derivatives are required, they are computed using only first order accurate finite difference approximations. We propose a new method for computing numerical derivatives based on 2D…
Extending work of M. Zarzar, we evaluate the potential of Goppa-type evaluation codes constructed from linear systems on projective algebraic surfaces with small Picard number. Putting this condition on the Picard number provides some…
In this work, we provide a local classification of certain special classes of surfaces determined by the prescription of the radial mean curvature in terms of the height and angle functions. Moreover, we introduce a special class of…
Approaches to ground surface reconstruction from massive terrestrial point clouds are presented. Using a set of local least squares (LSQR) planes, the "holes" are filled either from the ground model of the next coarser level or by Hermite…
We describe here the design and fabrication of a rewritable and reprintable paper as an alternative to conventional papers which are generally used for writing and printing purposes. This paper is prepared by casting a crosslinkable…
Constructions of optimal locally repairable codes (LRCs) in the case of $(r+1) \nmid n$ and over small finite fields were stated as open problems for LRCs in [I. Tamo \emph{et al.}, "Optimal locally repairable codes and connections to…
We develop technics of birational geometry to study automorphisms of affine surfaces admitting many distinct rational fibrations, with a particular focus on the interactions between automorphisms and these fibrations. In particular, we…
Locally repairable codes (LRC) have recently been a subject of intense research due to theoretical appeal and their application in distributed storage systems. In an LRC, any coordinate of a codeword can be recovered by accessing only few…
In the first part of this article, we consider ruled surfaces defined over a finite field; we introduce invariants for them, and describe some explicit contructions that illustrate possible behaviour of these invariants. In the second part,…
In recent years, several classes of codes are introduced to provide some fault-tolerance and guarantee system reliability in distributed storage systems, among which locally repairable codes (LRCs for short) play an important role. However,…
Locally repairable codes (LRCs) have gained significant interest for the design of large distributed storage systems as they allow a small number of erased nodes to be recovered by accessing only a few others. Several works have thus been…
We construct K3 surfaces over number fields that have good reduction everywhere. These do not exists over the rational numbers, by results of Abrashkin and Fontaine. Our surfaces exist for three quadratic number fields, and an infinite…
Maximally Recoverable Local Reconstruction Codes (LRCs) are codes designed for distributed storage to provide maximum resilience to failures for a given amount of storage redundancy and locality. An $(n,r,h,a,g)$-MR LRC has $n$ coordinates…
The surface code is a powerful quantum error correcting code that can be defined on a 2-D square lattice of qubits with only nearest neighbor interactions. Syndrome and data qubits form a checkerboard pattern. Information about errors is…
In this paper, we discuss codes for distributed storage systems with hierarchical repair properties. Specifically, we devote attention to the repair problem of the rack-aware storage model with locality, aiming to enhance the system's…