1988
DOI: 10.1049/el:19880116
|View full text |Cite
|
Sign up to set email alerts
|

Using Lagrange's interpolation formula to construct Reed-Solomon codes over GF(p)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2013
2013
2015
2015

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 1 publication
0
0
0
Order By: Relevance
“…can be called n times interpolation basis function on the basis of x i . In fact, since each interpolation function L k (x) is a denoted as Ln (x)[6,7,8]. The algorithm flow.Based on the theory of Lagrang interpolation algorithm and combined with MATLAB software,author makes use of computer programming, efficiently solving application problems.…”
mentioning
confidence: 99%
“…can be called n times interpolation basis function on the basis of x i . In fact, since each interpolation function L k (x) is a denoted as Ln (x)[6,7,8]. The algorithm flow.Based on the theory of Lagrang interpolation algorithm and combined with MATLAB software,author makes use of computer programming, efficiently solving application problems.…”
mentioning
confidence: 99%