A Class of Locally Recoverable Codes Over Finite Chain Rings - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2024

A Class of Locally Recoverable Codes Over Finite Chain Rings

Abstract

Locally recoverable codes deal with the task of reconstructing a lost symbol by relying on a portion of the remaining coordinates smaller than an information set. We consider the case of codes over finite chain rings, generalizing known results and bounds for codes over fields. In particular, we propose a new family of locally recoverable codes by extending a construction proposed in 2014 by Tamo and Barg, and we discuss its optimality.
Fichier principal
Vignette du fichier
Locally_recoverable_codes_over_finite_chain_rings-2.pdf (498.46 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

lirmm-04571704 , version 1 (08-05-2024)

Identifiers

  • HAL Id : lirmm-04571704 , version 1

Cite

Giulia Cavicchioni, Eleonora Guerrini, Alessio Meneghetti. A Class of Locally Recoverable Codes Over Finite Chain Rings. WCC 2024 - 13th International Workshop on Coding and Cryptography, Jun 2024, Perugia, Italy. ⟨lirmm-04571704⟩
0 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More