Search

We construct families of locally recoverable codes with availability t ≥ 2 using fiber products of curves, determine the exact minimum distance of many families, and prove a general theorem for minimum distance of such codes. The paper concludes with an exploration of parameters of codes from these families and the fiber product construction more generally. We show that fiber product codes can achieve arbitrarily large rate and arbitrarily small relative defect, and compare to known bounds and important constructions from the literature. [ABSTRACT FROM AUTHOR]

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 that 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. [ABSTRACT FROM AUTHOR]

The decreasing norm-trace codes are evaluation codes defined by a set of monomials closed under divisibility and the rational points of the extended norm-trace curve. In particular, the decreasing norm-trace codes contain the one-point algebraic geometry (AG) codes over the extended norm-trace curve. We use Gröbner basis theory and find the indicator functions on the rational points of the curve to determine the basic parameters of the decreasing norm-trace codes: length, dimension, and minimum distance. We also obtain their dual codes. We give conditions for a decreasing norm-trace code to be a self-orthogonal or a self-dual code. We provide a linear exact repair scheme to correct single erasures for decreasing norm-trace codes, which applies to higher rate codes than the scheme developed by Jin et al. (IEEE Trans Inf Theory 64(2):900–908, 2018) when applied to the one-point AG codes over the extended norm-trace curve. [ABSTRACT FROM AUTHOR]