skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Curve-lifted codes for local recovery using lines
Abstract In this paper, we introduce curve-lifted codes over fields of arbitrary characteristic, inspired by Hermitian-lifted codes over$$\mathbb {F}_{2^r}$$ F 2 r . These codes are designed for locality and availability, and their particular parameters depend on the choice of curve and its properties. Due to the construction, the numbers of rational points of intersection between curves and lines play a key role. To demonstrate that and generate new families of locally recoverable codes (LRCs) with high availabilty, we focus on norm-trace-lifted codes.  more » « less
Award ID(s):
2201075
PAR ID:
10524312
Author(s) / Creator(s):
; ;
Publisher / Repository:
Springer Science + Business Media
Date Published:
Journal Name:
Designs, Codes and Cryptography
Volume:
92
Issue:
11
ISSN:
0925-1022
Format(s):
Medium: X Size: p. 3645-3664
Size(s):
p. 3645-3664
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract This article revisits the problem of global well-posedness for the generalized parabolic Anderson model on$$\mathbb {R}^+\times \mathbb {T}^2$$ R + × T 2 within the framework of paracontrolled calculus (Gubinelli et al. in Forum Math, 2015). The model is given by the equation:$$\begin{aligned} (\partial _t-\Delta ) u=F(u)\eta \end{aligned}$$ ( t - Δ ) u = F ( u ) η where$$\eta \in C^{-1-\kappa }$$ η C - 1 - κ with$$1/6>\kappa >0$$ 1 / 6 > κ > 0 , and$$F\in C_b^2(\mathbb {R})$$ F C b 2 ( R ) . Assume that$$\eta \in C^{-1-\kappa }$$ η C - 1 - κ and can be lifted to enhanced noise, we derive new a priori bounds. The key idea follows from the recent work by Chandra et al. (A priori bounds for 2-d generalised Parabolic Anderson Model,,2024), to represent the leading error term as a transport type term, and our techniques encompass the paracontrolled calculus, the maximum principle, and the localization approach (i.e. high-low frequency argument). 
    more » « less
  2. Abstract We present an efficient algorithm to compute the Euler factor of a genus 2 curve$$C/\mathbb {Q}$$ C / Q at an odd primepthat is of bad reduction forCbut of good reduction for the Jacobian ofC(a prime of “almost good” reduction). Our approach is based on the theory of cluster pictures introduced by Dokchitser, Dokchitser, Maistret, and Morgan, which allows us to reduce the problem to a short, explicit computation over$$\mathbb {Z}$$ Z and$$\mathbb {F}_p$$ F p , followed by a point-counting computation on two elliptic curves over$$\mathbb {F}_p$$ F p , or a single elliptic curve over$$\mathbb {F}_{p^2}$$ F p 2 . A key feature of our approach is that we avoid the need to compute a regular model forC. This allows us to efficiently compute many examples that are infeasible to handle using the algorithms currently available in computer algebra systems such as Magma and Pari/GP. 
    more » « less
  3. Abstract We construct an example of a group$$G = \mathbb {Z}^2 \times G_0$$ G = Z 2 × G 0 for a finite abelian group $$G_0$$ G 0 , a subsetEof $$G_0$$ G 0 , and two finite subsets$$F_1,F_2$$ F 1 , F 2 of G, such that it is undecidable in ZFC whether$$\mathbb {Z}^2\times E$$ Z 2 × E can be tiled by translations of$$F_1,F_2$$ F 1 , F 2 . In particular, this implies that this tiling problem isaperiodic, in the sense that (in the standard universe of ZFC) there exist translational tilings ofEby the tiles$$F_1,F_2$$ F 1 , F 2 , but no periodic tilings. Previously, such aperiodic or undecidable translational tilings were only constructed for sets of eleven or more tiles (mostly in $$\mathbb {Z}^2$$ Z 2 ). A similar construction also applies for$$G=\mathbb {Z}^d$$ G = Z d for sufficiently large d. If one allows the group$$G_0$$ G 0 to be non-abelian, a variant of the construction produces an undecidable translational tiling with only one tile F. The argument proceeds by first observing that a single tiling equation is able to encode an arbitrary system of tiling equations, which in turn can encode an arbitrary system of certain functional equations once one has two or more tiles. In particular, one can use two tiles to encode tiling problems for an arbitrary number of tiles. 
    more » « less
  4. Abstract Given a prime powerqand$$n \gg 1$$ n 1 , we prove that every integer in a large subinterval of the Hasse–Weil interval$$[(\sqrt{q}-1)^{2n},(\sqrt{q}+1)^{2n}]$$ [ ( q - 1 ) 2 n , ( q + 1 ) 2 n ] is$$\#A({\mathbb {F}}_q)$$ # A ( F q ) for some ordinary geometrically simple principally polarized abelian varietyAof dimensionnover$${\mathbb {F}}_q$$ F q . As a consequence, we generalize a result of Howe and Kedlaya for$${\mathbb {F}}_2$$ F 2 to show that for each prime powerq, every sufficiently large positive integer is realizable, i.e.,$$\#A({\mathbb {F}}_q)$$ # A ( F q ) for some abelian varietyAover$${\mathbb {F}}_q$$ F q . Our result also improves upon the best known constructions of sequences of simple abelian varieties with point counts towards the extremes of the Hasse–Weil interval. A separate argument determines, for fixedn, the largest subinterval of the Hasse–Weil interval consisting of realizable integers, asymptotically as$$q \rightarrow \infty $$ q ; this gives an asymptotically optimal improvement of a 1998 theorem of DiPippo and Howe. Our methods are effective: We prove that if$$q \le 5$$ q 5 , then every positive integer is realizable, and for arbitraryq, every positive integer$$\ge q^{3 \sqrt{q} \log q}$$ q 3 q log q is realizable. 
    more » « less
  5. Abstract We study the production of$$D^0$$ D 0 meson inp+pandp-Pb collisions using the improved AMPT model considering both coalescence and independent fragmentation of charm quarks after the Cronin broadening is included. After a detailed discussion of the improvements implemented in the AMPT model for heavy quark production, we show that the modified AMPT model can provide a good description of$$D^0$$ D 0 meson spectra inp-Pb collisions, the$$Q_{\textrm{pPb}}$$ Q pPb data at different centralities and$$R_{\textrm{pPb}}$$ R pPb data in both mid- and forward (backward) rapidities. We also studied the effects of nuclear shadowing and parton cascade on the rapidity dependence of$$D^{0}$$ D 0 meson production and$$R_{\textrm{pPb}}$$ R pPb . Our results indicate that using the same strength of the Cronin effect (i.e$$\delta $$ δ value) as that obtained from the mid-rapidity data leads to a considerable overestimation of the$$D^0$$ D 0 meson spectra and$$R_{\textrm{pPb}}$$ R pPb data at high$$p_{\textrm{T}}$$ p T in the backward rapidity. As a result, the$$\delta $$ δ is determined via a$$\chi ^2$$ χ 2 fitting of the$$R_{\textrm{pPb}}$$ R pPb data across various rapidities. This work lays the foundation for a better understanding of cold-nuclear-matter (CNM) effects in relativistic heavy-ion collisions. 
    more » « less