On lattice reduction for polynomial matrices
From MaRDI portal
Publication:1401903
DOI10.1016/S0747-7171(02)00139-6zbMath1028.65038OpenAlexW1994728957MaRDI QIDQ1401903
Publication date: 19 August 2003
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0747-7171(02)00139-6
algorithmpolynomial matricesdeterminantcanonical formrank profilelattice reductionvector computationpolynomial linear system
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (31)
High-order lifting and integrality certification ⋮ Computing minimal interpolation bases ⋮ Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix ⋮ Computing Riemann-Roch spaces via Puiseux expansions ⋮ Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction ⋮ 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 ⋮ Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes ⋮ Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x\)] ⋮ Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory ⋮ Algorithms for simultaneous Hermite-Padé approximations ⋮ An efficient lattice reduction method for \(\mathbf F_2\)-linear pseudorandom number generators using Mulders and Storjohann algorithm ⋮ Revealing matrices of linear differential systems of arbitrary order ⋮ A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over \(\mathbb{Z} [x\)] ⋮ Fraction-free row reduction of matrices of Ore polynomials. ⋮ Normal forms for general polynomial matrices ⋮ On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators ⋮ List Decoding for Binary Goppa Codes ⋮ Deterministic computation of the characteristic polynomial in the time of matrix multiplication ⋮ A modular algorithm to compute the generalized Hermite normal form for \(\mathbb{Z}[x\)-lattices] ⋮ Inverse linear difference operators ⋮ Output-sensitive modular algorithms for polynomial matrix normal forms ⋮ Row reduction applied to decoding of rank-metric and subspace codes ⋮ On the \(q\)th power algorithm ⋮ Genus computation of global function fields ⋮ Essentially optimal computation of the inverse of generic polynomial matrices ⋮ Power decoding Reed-Solomon codes up to the Johnson radius ⋮ Fast computation of approximant bases in canonical form ⋮ 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:GI/C-MSP(a,b)/1/∞ ⋮ On Computing the Hermite Form of a Matrix of Differential Polynomials ⋮ Evaluation techniques for zero-dimensional primary decomposition
Cites Work
- Fast projection methods for minimal design problems in linear system theory
- Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients
- Certified dense linear system solving
- Hermite Normal Form Computation Using Modulo Determinant Arithmetic
- Rational solutions of singular linear systems
- Hensel and Newton Methods in Valuation Rings
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On lattice reduction for polynomial matrices
