On lattice reduction for polynomial matrices
From MaRDI portal
Publication:1401903
The authors present an algorithm for lattice reduction of polynomial matrices. The algorithm is applied to various tasks, including rank profile and determinant computation, transformation to Hermite and Popov canonical form, polynomial linear system solving and short vector computation.
Recommendations
Cites work
- Certified dense linear system solving
- Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients
- Fast projection methods for minimal design problems in linear system theory
- Hensel and Newton Methods in Valuation Rings
- Hermite Normal Form Computation Using Modulo Determinant Arithmetic
- scientific article; zbMATH DE number 1254300 (Why is no real title available?)
- scientific article; zbMATH DE number 1263389 (Why is no real title available?)
- scientific article; zbMATH DE number 2151242 (Why is no real title available?)
- scientific article; zbMATH DE number 3009965 (Why is no real title available?)
- scientific article; zbMATH DE number 3279238 (Why is no real title available?)
- scientific article; zbMATH DE number 3333686 (Why is no real title available?)
- scientific article; zbMATH DE number 3401090 (Why is no real title available?)
- Modern computer algebra
- Rational solutions of singular linear systems
Cited in
(42)- Evaluation techniques for zero-dimensional primary decomposition
- A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over \(\mathbb{Z} [x]\)
- Inverse linear difference operators
- Essentially optimal computation of the inverse of generic polynomial matrices
- Power decoding Reed-Solomon codes up to the Johnson radius
- High-order lifting and integrality certification
- Lattice basis reduction for indefinite forms and an application
- Column reduction of polynomial matrices; some remarks on the algorithm of Wolovich
- Computing Riemann-Roch spaces via Puiseux expansions
- Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction
- Algorithms for simultaneous Hermite-Padé approximations
- Revealing matrices of linear differential systems of arbitrary order
- On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication
- Genus computation of global function fields
- Fast computation of approximant bases in canonical form
- Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
- Fraction-free row reduction of matrices of Ore polynomials.
- Normal forms for general polynomial matrices
- Output-sensitive modular algorithms for polynomial matrix normal forms
- Computing minimal interpolation bases
- A simple and efficient computing procedure of the stationary system-length distributions for \(G I^X / D / c\) and \(B M a P / D / c\) queues
- Computing Popov forms of matrices over PBW extensions
- A simple analysis of system characteristics in the batch service queue with infinite-buffer and Markovian service process using the roots method: \(\mathrm{GI}/\mathrm{C-MSP}^{a,b}/1/\infty\)
- List Decoding for Binary Goppa Codes
- scientific article; zbMATH DE number 5532109 (Why is no real title available?)
- On Computing the Hermite Form of a Matrix of Differential Polynomials
- Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes
- Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x]\)
- Reduction of Matrix Polynomials to Simpler Forms
- A modular algorithm to compute the generalized Hermite normal form for \(\mathbb{Z}[x]\)-lattices
- Lattice equations and their solutions with complexity of polynomial class
- Row reduction applied to decoding of rank-metric and subspace codes
- Lamé polynomials, hyperelliptic reductions and Lamé band structure
- Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory
- An efficient lattice reduction method for \(\mathbf F_2\)-linear pseudorandom number generators using Mulders and Storjohann algorithm
- Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities
- Computing valuations of the Dieudonné determinants
- Faster modular composition
- Polynomial lattices for the BIKE cryptosystem
- On the \(q\)th power algorithm
- An application of lattice basis reduction to polynomial identities for algebraic structures
This page was built for publication: On lattice reduction for polynomial matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401903)
