Computing minimal interpolation bases (Q2628323): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
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: A reliable method for computing M-Padé approximants on arbitrary staircases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fraction-Free Computation of Matrix Rational Interpolants and Matrix GCDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal forms for general polynomial matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Key equations for list decoding of Reed-Solomon codes and how to solve them / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new method for computing a column reduced polynomial matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplified High-Speed High-Distance List Decoding for Alternant Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving structured linear systems with large displacement rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast solution of toeplitz systems of equations and computation of Padé approximants / 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: Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate common divisors via lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4423053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x]\) / 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: Fast projection methods for minimal design problems in linear system theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for the characteristic polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of parenthesis languages / 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: Powers of tensors and fast matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: List decoding of Reed-Solomon codes from a Gröbner basis perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5555126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattice reduction for polynomial matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A displacement approach to efficient decoding of algebraic-geometric codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recurrence relations in Padé-Hermite approximation / 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 computation of continued fraction expansions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursive algorithm for Padé-Hermite approximations / 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: The computation of non-perfect Padé-Hermite approximants / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general module theoretic framework for vector M-Padé and matrix rational interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modern Computer Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2851163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interpolation Procedure for List Decoding Reed–Solomon Codes Based on Generalized Key Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for order basis computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing minimal nullspace bases / rank
 
Normal rank

Latest revision as of 21:32, 13 July 2024

scientific article
Language Label Description Also known as
English
Computing minimal interpolation bases
scientific article

    Statements

    Computing minimal interpolation bases (English)
    0 references
    0 references
    0 references
    0 references
    1 June 2017
    0 references
    M-Padé approximation
    0 references
    Hermite-Padé approximation
    0 references
    polynomial interpolation
    0 references
    order basis
    0 references
    polynomial matrix
    0 references
    rational interpolation
    0 references
    bivariate interpolation
    0 references
    iterative algorithm
    0 references
    recurrence relation
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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