Scholarlink

<p>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. The principal issue in generalizing fields to rings is how to handle polynomial evaluation interpolation constructions.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A class of locally recoverable codes over finite chain rings

  • 期刊论文

  • 发表日期：

    2025年6月4日

查看全文
  • Giulia Cavicchioni,
  • Eleonora Guerrini,
  • Alessio Meneghetti

摘要

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. The principal issue in generalizing fields to rings is how to handle polynomial evaluation interpolation constructions.