اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLifted Reed-Solomon Codes with Application to Batch Codes
126
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Guo, Kopparty and Sudan have initiated the study of error-correcting codes derived by lifting of affine-invariant codes. Lifted Reed-Solomon (RS) codes are defined as the evaluation of polynomials in a vector space over a field by requiring their restriction to every line in the space to be a codeword of the RS code. In this paper, we investigate lifted RS codes and discuss their application to batch codes, a notion introduced in the context of private information retrieval and load-balancing in distributed storage systems. First, we improve the estimate of the code rate of lifted RS codes for lifting parameter $mge 3$ and large field size. Second, a new explicit construction of batch codes utilizing lifted RS codes is proposed. For some parameter regimes, our codes have a better trade-off between parameters than previously known batch codes.
قيم البحث
اقرأ أيضاً
In this article, we present a new construction of evaluation codes in the Hamming metric, which we call twisted Reed-Solomon codes. Whereas Reed-Solomon (RS) codes are MDS codes, this need not be the case for twisted RS codes. Nonetheless, we show th
at our construction yields several families of MDS codes. Further, for a large subclass of (MDS) twisted RS codes, we show that the new codes are not generalized RS codes. To achieve this, we use properties of Schur squares of codes as well as an explicit description of the dual of a large subclass of our codes. We conclude the paper with a description of a decoder, that performs very well in practice as shown by extensive simulation results.
In this article we count the number of generalized Reed-Solomon (GRS) codes of dimension k and length n, including the codes coming from a non-degenerate conic plus nucleus. We compare our results with known formulae for the number of 3-dimensional MDS codes of length n=6,7,8,9.
Maximum distance separable (MDS) codes are optimal where the minimum distance cannot be improved for a given length and code size. Twisted Reed-Solomon codes over finite fields were introduced in 2017, which are generalization of Reed-Solomon codes.
Twisted Reed-Solomon codes can be applied in cryptography which prefer the codes with large minimum distance. MDS codes can be constructed from twisted Reed-Solomon codes, and most of them are not equivalent to Reed-Solomon codes. In this paper, we first generalize twisted Reed-Solomon codes to generalized twisted Reed-Solomon codes, then we give some new explicit constructions of MDS (generalized) twisted Reed-Solomon codes. In some cases, our constructions can get MDS codes with the length longer than the constructions of previous works. Linear complementary dual (LCD) codes are linear codes that intersect with their duals trivially. LCD codes can be applied in cryptography. This application of LCD codes renewed the interest in the construction of LCD codes having a large minimum distance. We also provide new constructions of LCD MDS codes from generalized twisted Reed-Solomon codes.
Recently, Martinez-Penas and Kschischang (IEEE Trans. Inf. Theory, 2019) showed that lifted linearized Reed-Solomon codes are suitable codes for error control in multishot network coding. We show how to construct and decode lifted interleaved lineari
zed Reed-Solomon codes. Compared to the construction by Martinez-Penas-Kschischang, interleaving allows to increase the decoding region significantly (especially w.r.t. the number of insertions) and decreases the overhead due to the lifting (i.e., increases the code rate), at the cost of an increased packet size. The proposed decoder is a list decoder that can also be interpreted as a probabilistic unique decoder. Although our best upper bound on the list size is exponential, we present a heuristic argument and simulation results that indicate that the list size is in fact one for most channel realizations up to the maximal decoding radius.
A linear code is called an MDS self-dual code if it is both an MDS code and a self-dual code with respect to the Euclidean inner product. The parameters of such codes are completely determined by the code length. In this paper, we consider new constr
uctions of MDS self-dual codes via generalized Reed-Solomon (GRS) codes and their extended codes. The critical idea of our constructions is to choose suitable evaluation points such that the corresponding (extended) GRS codes are self-dual. The evaluation set of our constructions is consists of a subgroup of finite fields and its cosets in a bigger subgroup. Four new families of MDS self-dual codes are obtained and they have better parameters than previous results in certain region. Moreover, by the Mobius action over finite fields, we give a systematic way to construct self-dual GRS codes with different evaluation points provided any known self-dual GRS codes. Specially, we prove that all the self-dual extended GRS codes over $mathbb{F}_{q}$ with length $n< q+1$ can be constructed from GRS codes with the same parameters.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
