Decoding of Reed Solomon codes beyond the error-correction bound (Q1361883): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: DBLP publication ID (P1635): journals/jc/Sudan97, #quickstatements; #temporary_batch_1731530891435
 
(5 intermediate revisions by 5 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089272132 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q100328979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing Algebraic Functions from Mixed Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the inherent intractability of certain coding problems (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of decoding linear codes with preprocessing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of computing the permanent of random matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4863699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly resilient correctors for polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3946078 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jc/Sudan97 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:04, 13 November 2024

scientific article
Language Label Description Also known as
English
Decoding of Reed Solomon codes beyond the error-correction bound
scientific article

    Statements

    Decoding of Reed Solomon codes beyond the error-correction bound (English)
    0 references
    0 references
    16 September 1997
    0 references
    randomized algorithm
    0 references
    maximum likelihood decoding algorithm
    0 references
    decoding of Reed-Solomon codes
    0 references
    polynomial time bounded algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references