On the Error-Correcting Radius of Folded Reed–Solomon Code Designs (Q3460451): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Highly resilient correctors for polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved decoding of Reed-Solomon and algebraic-geometry codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper Bounds on the Number of Errors Corrected by a Convolutional Code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding of Reed Solomon codes beyond the error-correction bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness / rank
 
Normal rank

Latest revision as of 06:55, 11 July 2024

scientific article
Language Label Description Also known as
English
On the Error-Correcting Radius of Folded Reed–Solomon Code Designs
scientific article

    Statements

    On the Error-Correcting Radius of Folded Reed–Solomon Code Designs (English)
    0 references
    0 references
    7 January 2016
    0 references
    decoding radius
    0 references
    low-order folded Reed-Solomon codes
    0 references
    multivariate interpolation
    0 references
    Parvaresh-Vardy codes
    0 references

    Identifiers