Distance Distribution to Received Words in Reed-Solomon Codes

06/01/2018
by   Jiyou Li, et al.
0

n this paper, we obtain an asymptotic formula for the number of codewords with a fixed distance to a given received word of degree k+m in the standard Reed-Solomon code [q, k, q-k+1]_q. Previously, explicit formulas were known only for the cases m=0, 1, 2.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/23/2018

Explicit Formulas for the Weight Enumerators of Some Classes of Deletion Correcting Codes

We introduce a general class of codes which includes several well-known ...
research
09/18/2023

On the Minimum Distance, Minimum Weight Codewords, and the Dimension of Projective Reed-Muller Codes

We give an alternative proof of the formula for the minimum distance of ...
research
01/16/2019

Deep Holes of Projective Reed-Solomon Codes

Projective Reed-Solomon (PRS) codes are Reed-Solomon codes of the maximu...
research
05/09/2021

Generative Mechanisms: The mechanisms that implement codes

The purpose of this paper is to abstractly describe the notion of a gene...
research
01/23/2021

Exactness of quadrature formulas

The standard design principle for quadrature formulas is that they shoul...
research
07/13/2017

Superposition de calques monochromes d'opacités variables

For a monochrome layer x of opacity 0< o_x<1 placed on another monochro...
research
10/12/2020

Unweighted linear congruences with distinct coordinates and the Varshamov–Tenengolts codes

In this paper, we first give explicit formulas for the number of solutio...

Please sign up or login with your details

Forgot password? Click here to reset