Polynomial root finding over local rings and application to error correcting codes (Q2441447): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s00200-013-0200-5 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed–Solomon Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved List Decoding of Generalized Reed–Solomon and Alternant Codes Over Galois Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Decoding of Generalized Reed–Solomon Codes Over Commutative Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2949568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxed algorithms for \(p\)-adic numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4314299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial evaluation and interpolation on special sets of points / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fast multiplication of polynomials over arbitrary algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: On expansion of algebraic functions in power and Puiseux series. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On expansion of algebraic functions in power and Puiseux series. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure and Ideal Theory of Complete Local Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3476962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective procedures in field theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Decoding Reed-Solomon Codes / 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: Complexity bounds for the rational Newton-Puiseux algorithm over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4842418 / 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: Computing local integral closures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of computation of embedded resolution of algebraic curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of expansion base algorithm for multivariate analytic factorization including the case of singular leading coefficient / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algebraic closure of the power series field in positive characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic soft-decision decoding of reed-solomon codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Newton-Puiseux Theory and Hensel's Lemma in C[[x, y]] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2770573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast separable factorization and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Correction Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5570258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient decoding of Reed-Solomon codes beyond half the minimum distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast multiplication of large numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4406533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hensel and Newton Methods in Valuation Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic geometric codes over rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of rational Puiseux expansions / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00200-013-0200-5 / rank
 
Normal rank

Latest revision as of 15:58, 18 December 2024

scientific article
Language Label Description Also known as
English
Polynomial root finding over local rings and application to error correcting codes
scientific article

    Statements

    Polynomial root finding over local rings and application to error correcting codes (English)
    0 references
    0 references
    0 references
    0 references
    24 March 2014
    0 references
    polynomial root finding
    0 references
    Galois ring
    0 references
    list decoding
    0 references
    Guruswami-Sudan algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers