Optimal \((r,\delta )\)-LRCs from monomial-Cartesian codes and their subfield-subcodes
From MaRDI portal
Publication:6591961
DOI10.1007/S10623-024-01403-ZMaRDI QIDQ6591961
Carlos Galindo Pastor, Helena Martín-Cruz, Fernando Hernando
Publication date: 23 August 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- Title not available (Why is that?)
- Stabilizer quantum codes from \(J\)-affine variety codes and a new Steane-like enlargement
- Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes
- Locally recoverable codes from algebraic curves and surfaces
- Locally recoverable codes from rational maps
- Locally recoverable \(J\)-affine variety codes
- The dual of an evaluation code
- Locally recoverable codes from algebraic curves with separated variables
- Constructions of optimal locally recoverable codes via Dickson polynomials
- Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length
- Quantum codes from affine variety codes and their subfield-subcodes
- On the distance of stabilizer quantum codes from \(J\)-affine variety codes
- Affine Cartesian codes
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- A Family of Optimal Locally Recoverable Codes
- On the Locality of Codeword Symbols
- New Constructions of Optimal Locally Recoverable Codes via Good Polynomials
- Constructions of Optimal Cyclic $({r},{\delta })$ Locally Repairable Codes
- Optimal Locally Repairable Codes Via Elliptic Curves
- Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
- Locally Recoverable Codes on Surfaces
- Long Optimal and Small-Defect LRC Codes With Unbounded Minimum Distances
- Polar Decreasing Monomial-Cartesian Codes
- New Constructions of Optimal Cyclic (r, δ) Locally Repairable Codes From Their Zeros
- New Constructions of Optimal Locally Repairable Codes With Super-Linear Length
- Constructions of optimal locally repairable codes over small fields
- Constructions of Optimal Codes With Hierarchical Locality
- Constructions of Locally Recoverable Codes Which are Optimal
- How Long Can Optimal Locally Repairable Codes Be?
- Explicit Construction of Optimal Locally Recoverable Codes of Distance 5 and 6 via Binary Constant Weight Codes
- Locally Recoverable Codes on Algebraic Curves
- A family of codes with variable locality and availability
- Three New Constructions of Optimal Locally Repairable Codes From Matrix-Product Codes
This page was built for publication: Optimal \((r,\delta )\)-LRCs from monomial-Cartesian codes and their subfield-subcodes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6591961)