Improving the dimension bound of Hermitian Lifted Codes

02/03/2023
by   Austin Allen, et al.
0

In this article we improve the dimension and minimum distance bound of the the Hermitian Lifted Codes LRCs construction from López, Malmskog, Matthews, Piñero and Wooters via elementary univariarte polynomial division. They gave an asymptotic rate estimate of 0.007. We improve the rate estimate to 0.1 using univariate polynomial division

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/11/2022

Improving the minimum distance bound of Trace Goppa codes

In this article we prove that a class of Goppa codes whose Goppa polynom...
research
07/11/2019

Estimating the division rate from indirect measurements of single cells

Is it possible to estimate the dependence of a growing and dividing popu...
research
02/22/2019

Characterizing PSPACE with shallow non-confluent P systems

In P systems with active membranes, the question of understanding the po...
research
10/10/2019

Construction of Const Dimension Code from Two Parallel Versions of Linkage Construction

According the report [10], the lower bound with the highest score is the...
research
10/04/2021

Sequences of linear codes where the rate times distance grows rapidly

For a linear code C of length n with dimension k and minimum distance d,...
research
12/14/2021

Parameterized codes over graphs

In this article we review known results on parameterized linear codes ov...
research
02/24/2020

Fast In-place Algorithms for Polynomial Operations: Division, Evaluation, Interpolation

We consider space-saving versions of several important operations on uni...

Please sign up or login with your details

Forgot password? Click here to reset