Bases of Riemann-Roch spaces associated with arbitrary elliptic curve divisors and their application in constructing various elliptic Codes families

• URL: http://arxiv.org/abs/2508.04340v1
• Date: Wed, 06 Aug 2025 11:34:05 GMT
• Title: Bases of Riemann-Roch spaces associated with arbitrary elliptic curve divisors and their application in constructing various elliptic Codes families
• Authors: Artyom Kuninets, Ekaterina Malygina,
• Abstract summary: We establish the feasibility and provide exact algorithms for constructing bases of Riemann--Roch spaces corresponding to arbitrary divisors on elliptic curves.<n>We derive bases for quasi-cyclic elliptic codes and their subfield subcodes as well as for the class of Goppa-like elliptic codes.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we determine explicit bases for Riemann--Roch spaces associated with various families of elliptic codes. We establish the feasibility and provide exact algorithms for constructing bases of Riemann--Roch spaces corresponding to arbitrary divisors on elliptic curves. These results are subsequently applied to derive bases for quasi-cyclic elliptic codes and their subfield subcodes as well as for the class of Goppa-like elliptic codes. For algebraic geometry code applications, having an explicit description of Riemann--Roch space bases for arbitrary divisors is particularly valuable as it simultaneously enables efficient code construction and reveals structural properties of the codes leading to the new cryptanalysis methods when these codes are employed in cryptographic schemes

Related papers

• The Tangent Space Attack [0.0]
  We propose a new method for retrieving the structure of a generic alternant code given an arbitrary generator matrix.<n>We then discuss how this challenges the security of the McEliece cryptosystem instantiated with this family of codes.
  arXiv  Detail & Related papers  (2025-05-15T11:30:46Z)
• Lattice Surgery Compilation Beyond the Surface Code [44.47912078290474]
  We consider lattice surgery compilation for topological codes beyond the surface code.<n>We explore specific substrates and codes, including the color code and the folded surface code.<n>For the color code, we present numerical simulations analyzing how design choices at the microscopic and macroscopic levels affect the depth of compiled logical $mathrmCNOT+mathrmT$ circuits.
  arXiv  Detail & Related papers  (2025-04-14T18:00:06Z)
• Coxeter codes: Extending the Reed-Muller family [59.90381090395222]
  We introduce a class of binary linear codes that generalizes the RM family by replacing the domain $mathbbZm$ with an arbitrary finite Coxeter group.<n> Coxeter codes also give rise to a family of quantum codes for which closed diagonal $Z$ rotations can perform non-trivial logic.
  arXiv  Detail & Related papers  (2025-02-20T17:16:28Z)
• Targeted Clifford logical gates for hypergraph product codes [61.269295538188636]
  We construct explicit targeted logical gates for hypergraph product codes. As a concrete example, we give logical circuits for the $[[18,2,3]]$ toric code.
  arXiv  Detail & Related papers  (2024-11-26T02:32:44Z)
• Unifying error-correcting code/Narain CFT correspondences via lattices over integers of cyclotomic fields [0.0]
  We identify Narain conformal field theories that correspond to code lattices for quantum error-correcting codes (QECC) over integers of cyclotomic fields $Q(zeta_p)$ $(zeta_p=efrac2pi ip)$ for general prime $pgeq 3$.<n>This code-lattice construction is a generalization of more familiar ones such as Construction A$_C$ for ternary codes and (after the generalization stated below) Construction A for binary codes, containing them as special cases.
  arXiv  Detail & Related papers  (2024-10-16T12:08:04Z)
• RMLR: Extending Multinomial Logistic Regression into General Geometries [64.16104856124029]
  Our framework only requires minimal geometric properties, thus exhibiting broad applicability. We develop five families of SPD MLRs under five types of power-deformed metrics. On rotation matrices we propose Lie MLR based on the popular bi-invariant metric.
  arXiv  Detail & Related papers  (2024-09-28T18:38:21Z)
• Maximally Extendable Sheaf Codes [5.439020425819001]
  We study sheaf codes, a type of linear codes with a fixed hierarchical collection of local codes. We introduce a new property of a sheaf code, called maximalibility, which ensures that within class of codes on the same coded space, we encounter as few obstructions as possible.
  arXiv  Detail & Related papers  (2024-03-06T12:20:49Z)
• Geometrically Local Quantum and Classical Codes from Subdivision [10.357542321841887]
  A geometrically local quantum code is an error correcting code situated within $mathbbRD$, where the checks only act on qubits within a fixed spatial distance. Recently, Portnoy made a significant breakthrough with codes achieving optimal dimension and distance up to polylogs. This paper bypasses this step and streamlines the construction by noticing that a family of good quantum low-density parity-check codes, balanced product codes, naturally carries a two-dimensional structure.
  arXiv  Detail & Related papers  (2023-09-28T02:12:38Z)
• CSS code surgery as a universal construction [51.63482609748332]
  We define code maps between Calderbank-Shor-Steane (CSS) codes using maps between chain complexes. We describe code surgery between such codes using a specific colimit in the category of chain complexes.
  arXiv  Detail & Related papers  (2023-01-31T16:17:25Z)
• Entanglement-Assisted Quantum Error-Correcting Codes over Local Frobenius Rings [10.533569558002796]
  We provide a framework for constructing entanglement-assisted quantum error-correcting codes (EAQECCs) from classical additive codes over a finite commutative local Frobenius ring $mathcalR$. We also demonstrate how adding extra coordinates to an additive code can give us a certain degree of flexibility in determining the parameters of the EAQECCs that result from our construction.
  arXiv  Detail & Related papers  (2022-02-01T06:58:56Z)
• A singular Riemannian geometry approach to Deep Neural Networks I. Theoretical foundations [77.86290991564829]
  Deep Neural Networks are widely used for solving complex problems in several scientific areas, such as speech recognition, machine translation, image analysis. We study a particular sequence of maps between manifold, with the last manifold of the sequence equipped with a Riemannian metric. We investigate the theoretical properties of the maps of such sequence, eventually we focus on the case of maps between implementing neural networks of practical interest.
  arXiv  Detail & Related papers  (2021-12-17T11:43:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.