Author Contributions:Dr Loprinzi had full access to all of the data in the study and takes responsibility for the integrity of the data and the accuracy of the data analysis. Study concept and design: Loprinzi, Brodowicz. Acquisition, analysis, or interpretation of data: Loprinzi, Sengupta, Solomon, Ramulu. Drafting of the manuscript: Loprinzi, Brodowicz. Critical revision of the manuscript for...

Determining deep holes is an important topic in decoding Reed-Solomon codes. In a previous paper [8], we showed that the received word u is a deep hole of the standard Reed-Solomon codes [q− 1, k]q if its Lagrange interpolation polynomial is the sum of monomial of degree q− 2 and a polynomial of degree at most k− 1. In this paper, we extend this result by giving a new class of deep holes of the...

We propose to reduce the decoding complexity of polar codes with non-Arikan kernels by employing a (near) ML decoding algorithm for the codes generated by kernel rows. A generalization of the order statistics algorithm is presented for soft decoding of Reed-Solomon codes. Algebraic properties of the Reed-Solomon code are exploited to increase the reprocessing order. The obtained algorithm is us...

395 Abstract—Reed-Solomon Codes are popularly used for error correction in many applications like storage devices (CD, DVD), wireless communications, high speed modems and satellite communications. In this paper, a modified scheme for programmable generator polynomial based Reed-Solomon encoder and decoder has been proposed. The works reported in this paper corrects errors in derived equations ...

Executive Summary This paper discusses impediments to female candidate success in national elections in the Western Melanesian country of Solomon Islands. Increased female representation in parliaments is desirable both for reasons of gender equity and because evidence suggests such increases come coupled with development benefits. Yet, while numbers of women members of parliament (MPs) are inc...

Reed-Solomon codes and Gabidulin codes have maximum Hamming distance and maximum rank distance, respectively. A general construction using skew polynomials, called skew Reed-Solomon codes, has already been introduced in the literature. In this work, we introduce a linearized version of such codes, called linearized Reed-Solomon codes. We prove that they have maximum sum-rank distance. Such dist...

Any opinions expressed in this memoir are those of the author(s) and do not necessarily reflect the views of the National Academy of Sciences. national aCademy of sCienCes washington d.C.