Pages that link to "Item:Q1401903"
From MaRDI portal
The following pages link to On lattice reduction for polynomial matrices (Q1401903):
Displaying 40 items.
- Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes (Q398959) (← links)
- Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x]\) (Q412209) (← links)
- A modular algorithm to compute the generalized Hermite normal form for \(\mathbb{Z}[x]\)-lattices (Q504418) (← links)
- Row reduction applied to decoding of rank-metric and subspace codes (Q510489) (← links)
- An efficient lattice reduction method for \(\mathbf F_2\)-linear pseudorandom number generators using Mulders and Storjohann algorithm (Q645697) (← links)
- On the \(q\)th power algorithm (Q958619) (← links)
- An application of lattice basis reduction to polynomial identities for algebraic structures (Q959868) (← links)
- Evaluation techniques for zero-dimensional primary decomposition (Q1030246) (← links)
- A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over \(\mathbb{Z} [x]\) (Q1725693) (← links)
- Inverse linear difference operators (Q1746360) (← links)
- Essentially optimal computation of the inverse of generic polynomial matrices (Q1763425) (← links)
- Power decoding Reed-Solomon codes up to the Johnson radius (Q1783708) (← links)
- High-order lifting and integrality certification (Q1878491) (← links)
- Lattice basis reduction for indefinite forms and an application (Q1917523) (← links)
- Column reduction of polynomial matrices; some remarks on the algorithm of Wolovich (Q1925143) (← links)
- Computing Riemann-Roch spaces via Puiseux expansions (Q2171940) (← links)
- Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction (Q2179403) (← links)
- Algorithms for simultaneous Hermite-Padé approximations (Q2200312) (← links)
- Revealing matrices of linear differential systems of arbitrary order (Q2216797) (← links)
- On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators (Q2229848) (← links)
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication (Q2238844) (← links)
- Genus computation of global function fields (Q2252117) (← links)
- Fast computation of approximant bases in canonical form (Q2284957) (← links)
- Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix (Q2402419) (← links)
- Fraction-free row reduction of matrices of Ore polynomials. (Q2457346) (← links)
- Normal forms for general polynomial matrices (Q2457359) (← links)
- Output-sensitive modular algorithms for polynomial matrix normal forms (Q2470057) (← links)
- Computing minimal interpolation bases (Q2628323) (← links)
- 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 (Q2669671) (← links)
- Computing Popov Forms of Matrices Over PBW Extensions (Q2799551) (← links)
- 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\) (Q2826663) (← links)
- List Decoding for Binary Goppa Codes (Q3005580) (← links)
- (Q3615929) (← links)
- On Computing the Hermite Form of a Matrix of Differential Polynomials (Q3644094) (← links)
- Reduction of Matrix Polynomials to Simpler Forms (Q4604561) (← links)
- Lattice equations and their solutions with complexity of polynomial class (Q5047109) (← links)
- Lamé polynomials, hyperelliptic reductions and Lamé band structure (Q5503951) (← links)
- Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory (Q6123057) (← links)
- Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities (Q6631548) (← links)
- Computing valuations of the Dieudonné determinants (Q6666553) (← links)
