Gröbner basis solutions of constrained interpolation problems
From MaRDI portal
Publication:1611921
DOI10.1016/S0024-3795(01)00509-2zbMath1008.93036MaRDI QIDQ1611921
Henry O'Keeffe, Patrick Fitzpatrick
Publication date: 28 August 2002
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
error-correcting codesconstrained interpolationsoft-decision decodingM-Padé approximationrecursive Gröbner basisSudan's algorithm
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Computing syzygies in finite dimension using fast linear algebra ⋮ A Fitzpatrick algorithm for multivariate rational interpolation ⋮ The Neville-like form of the Fitzpatrick algorithm for rational interpolation ⋮ List decoding of Reed-Solomon codes from a Gröbner basis perspective ⋮ The vanishing ideal of a finite set of closed points in affine space ⋮ Key equations for list decoding of Reed-Solomon codes and how to solve them ⋮ List decoding codes on Garcia-Stichtenoth tower using Gröbner basis ⋮ The Fitzpatrick-Neville-type algorithm for multivariate vector-valued osculatory rational interpolation
Cites Work
- Recursiveness in matrix rational interpolation problems
- On the scalar rational interpolation problem
- Decoding of Reed Solomon codes beyond the error-correction bound
- Error-correcting codes for list decoding
- A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
- Lifting standard bases in filtered structures
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Efficient decoding of Reed-Solomon codes beyond half the minimum distance
- On the key equation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Gröbner basis solutions of constrained interpolation problems
