AI Chat AI Image Generator AI Video Text to Speech

A construction of maximally recoverable codes

08/19/2021

∙

by Alexander Barg, et al.

∙

∙

We construct a family of linear maximally recoverable codes with locality r and dimension r+1. For codes of length n with r≈ n^α, 0≤α≤ 1 the code alphabet is of the order n^1+3α, which improves upon the previously known constructions of maximally recoverable codes.

Alexander Barg
22 publications
Zitan Chen
10 publications
Itzhak Tamo
23 publications

page 1

page 2

page 3

page 4

research

∙ 07/02/2022

Construction of quaternary Hermitian LCD codes

We introduce a general construction of many Hermitian LCD [n, k] codes f...

0 Keita Ishizuka, et al. ∙

research

∙ 06/01/2023

Linear codes with arbitrary dimensional hull and pure LCD code

In this paper, we introduce a general construction of linear codes with ...

0 Maouche Youcef, et al. ∙

research

∙ 04/14/2020

Cyclic and convolutional codes with locality

Locally recoverable (LRC) codes and their variants have been extensively...

0 Zitan Chen, et al. ∙

research

∙ 09/25/2020

Construction on Griesmer Codes with Dimension Not Less than Five

In this paper we construct new Griesmer codes of dimension k≥ 5 by means...

0 Wen Ma, et al. ∙

research

∙ 02/01/2018

Optimal LRC codes for all lenghts n <= q

A family of distance-optimal LRC codes from certain subcodes of q-ary Re...

0 Oleg Kolosov, et al. ∙

research

∙ 01/21/2019

A construction of UD k-ary multi-user codes from (2^m(k-1)+1)-ary codes for MAAC

In this paper, we proposed a construction of a UD k-ary T-user coding sc...

0 Shan Lu, et al. ∙

research

∙ 05/05/2021

Improved Singleton bound on insertion-deletion codes and optimal constructions

Insertion-deletion codes (insdel codes for short) play an important role...

0 Bocong Chen, et al. ∙