Cover Image

Easy repair via codes with simplex locality

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kuijper, Margreta, Lieb, Julia, Napp, Diego
Format:	Preprint
Published:	2025
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On Unified and Sharpened CMI Bounds for Generalization Errors
by: Lu, Yang, et al.
Published: (2026)

Construction of LDPC convolutional codes with large girth from Latin squares
by: Junghans, Elisa, et al.
Published: (2025)

Constructions of locally repairable codes via concatenated codes
by: Jin, Hengfeng, et al.
Published: (2026)

A new method for erasure decoding of convolutional codes
by: Lieb, Julia, et al.
Published: (2025)

Construction and Decoding of Convolutional Codes with optimal Column Distances
by: Lieb, Julia, et al.
Published: (2026)

Asymptotic construction of locally repairable codes with multiple recovering sets
by: Li, Singsong, et al.
Published: (2024)

Geometric construction of k-optimal locally repairable codes
by: Fu, Yi, et al.
Published: (2026)

Pseudo-MDP Convolutional Codes for Burst Erasure Correction
by: Abreu, Zita, et al.
Published: (2026)

An Improved Viterbi Algorithm for a Class of Optimal Binary Convolutional Codes
by: Abreu, Zita, et al.
Published: (2024)

The constructions of Singleton-optimal locally repairable codes with minimum distance 6 and locality 3
by: Xiong, Yanzhen, et al.
Published: (2026)

Linear codes over a mixed-alphabet ring and their Gray images with applications to projective and locally repairable codes
by: Jose, Leijo, et al.
Published: (2025)

Design of MDP Convolutional Codes and Maximally Recoverable Codes Through the Lens of Matrix Completion
by: Dang, Sakshi, et al.
Published: (2026)

Generalized regenerating codes and node repair on graphs
by: Patra, Adway, et al.
Published: (2024)

Explicit optimal-length locally repairable codes of distance 5
by: Beemer, Allison, et al.
Published: (2018)

A Matrix Completion Approach for the Construction of MDP Convolutional Codes
by: Dang, Sakshi, et al.
Published: (2025)

Optimal quantum locally recoverable codes from matrix-product construction
by: Galindo, Carlos, et al.
Published: (2023)

Optimal Multidimensional Convolutional Codes
by: Abreu, Z., et al.
Published: (2026)

Weighed l1 on the simplex: Compressive sensing meets locality
by: Tasissa, Abiy, et al.
Published: (2021)

Regenerating codes with minimal disk I/O cost achieving optimal tradeoff between storage and repair bandwidth
by: Gao, Minhan, et al.
Published: (2026)

Information-geometrical characterization of statistical models which are statistically equivalent to probability simplexes
by: Nagaoka, Hiroshi
Published: (2017)

The augmented codes of a family of linear codes with locality 2
by: Heng, Ziling, et al.
Published: (2024)

Maximally recoverable codes with locality and availability
by: Martínez-Peñas, Umberto, et al.
Published: (2025)

Linear exact repair schemes for free MDS and Reed-Solomon codes over Galois rings
by: Bossaller, Daniel P., et al.
Published: (2025)

Stabilizer quantum codes from $J$-affine variety codes and a new Steane-like enlargement
by: Galindo, Carlos, et al.
Published: (2015)

List decoding of repeated codes
by: Hernando, Fernando, et al.
Published: (2012)

The Schur product of evaluation codes and its application to CSS-T quantum codes and private information retrieval
by: Bodur, Şeyma, et al.
Published: (2025)

A family of self-orthogonal divisible codes with locality 2
by: Heng, Ziling, et al.
Published: (2024)

Weight distributions of simplex codes over finite chain rings and their Gray map images
by: Fernández-Córdoba, Cristina, et al.
Published: (2025)

Duals of multiplicity codes
by: Moreno, Eduardo Camps, et al.
Published: (2025)

The Information Specialist Customer Partnership.
by: Bennett, Christine, et al.
Published: (1997)

Improved bounds and optimal constructions of pure quantum locally recoverable codes
by: Li, Yang, et al.
Published: (2025)

Erasures repair for decreasing monomial-Cartesian and augmented Reed-Muller codes of high rate
by: López, Hiram H., et al.
Published: (2021)

Stabilizer quantum codes defined by trace-depending polynomials
by: Galindo, Carlos, et al.
Published: (2022)

New constructions of MDS symbol-pair codes via simple-root cyclic codes
by: Qiu, Rongxing, et al.
Published: (2025)

Introducing locality in some generalized AG codes
by: Pacifico, Bastien
Published: (2024)

Scheduling Multi-Server Jobs is Not Easy
by: Vaze, Rahul
Published: (2024)

Lightweight Conceptual Dictionary Learning for Text Classification Using Information Compression
by: Wan, Li, et al.
Published: (2024)

A repair scheme for a distributed storage system based on multivariate polynomials
by: López, Hiram H., et al.
Published: (2025)

On the Euclidean duals of the cyclic codes generated via cyclotomic polynomials
by: Bhagat, Anuj Kumar, et al.
Published: (2026)

On the structure of repeated-root polycyclic codes over local rings
by: Bajalan, Maryam, et al.
Published: (2022)