C. Bajaj, The algebraic degree of geometric optimization problems, Discrete & Computational Geometry, vol.27, issue.39, pp.177-191, 1988.
DOI : 10.1007/BF02187906

E. R. Berlekamp, Nonbinary BCH decoding, 1966.

A. Bernardi, A. Gimigliano, and M. Ida, Computing symmetric rank for symmetric tensors, Journal of Symbolic Computation, vol.46, issue.1, pp.34-53, 2011.
DOI : 10.1016/j.jsc.2010.08.001
URL : https://hal.archives-ouvertes.fr/hal-00645973

J. Brachat, P. Comon, B. Mourrain, and E. Tsigaridas, Symmetric tensor decomposition, Linear Algebra and its Applications, vol.433, issue.11-12, pp.1851-1872, 2010.
DOI : 10.1016/j.laa.2010.06.046
URL : https://hal.archives-ouvertes.fr/inria-00355713

G. Comas and M. Seiguer, On the Rank of a Binary Form, Foundations of Computational Mathematics, vol.117, issue.2, pp.65-78, 2011.
DOI : 10.1007/s10208-010-9077-x

P. Comon, Tensors : A brief introduction, IEEE Signal Processing Magazine, vol.31, issue.3, pp.44-53, 2014.
DOI : 10.1109/MSP.2014.2298533
URL : https://hal.archives-ouvertes.fr/hal-00923279

P. Comon and B. Mourrain, Decomposition of quantics in sums of powers of linear forms, Signal Processing, vol.53, issue.2-3, pp.93-107, 1996.
DOI : 10.1016/0165-1684(96)00079-5

P. Comon, G. Golub, L. Lim, and B. Mourrain, Symmetric Tensors and Symmetric Tensor Rank, SIAM Journal on Matrix Analysis and Applications, vol.30, issue.3, pp.1254-1279, 2008.
DOI : 10.1137/060661569
URL : https://hal.archives-ouvertes.fr/hal-00327599

A. Dür, On computing the canonical form for a binary form of odd degree, Journal of Symbolic Computation, vol.8, issue.4, pp.327-333, 1989.
DOI : 10.1016/S0747-7171(89)80034-3

J. V. Gathen and J. Gerhard, Modern computer algebra

S. Gundelfinger, Zur theorie der binären formen, Journal für die reine und angewandte Mathematik, pp.413-424, 1887.

G. Heinig and K. Rost, Algebraic methods for Toeplitz-like matrices and operators, 1984.
DOI : 10.1007/978-3-0348-6241-7

U. Helmke, Waring's problem for binary forms, Journal of Pure and Applied Algebra, vol.80, issue.1, pp.29-45, 1992.
DOI : 10.1016/0022-4049(92)90067-P
URL : http://doi.org/10.1016/0022-4049(92)90067-p

A. Iarrobino and V. Kanev, Power sums, Gorenstein algebras, and determinantal loci, 1999.
DOI : 10.1007/BFb0093426

K. Imamura and W. Yoshida, A simple derivation of the Berlekamp- Massey algorithm and some applications (Corresp.), IEEE Transactions on Information Theory, vol.33, issue.1, pp.146-150, 1987.
DOI : 10.1109/TIT.1987.1057261

E. Jonckheere and C. Ma, A simple Hankel interpretation of the Berlekamp-Massey algorithm, Linear Algebra and its Applications, vol.125, pp.65-76, 1989.
DOI : 10.1016/0024-3795(89)90032-3

E. Kaltofen and L. Yagati, Improved sparse multivariate polynomial interpolation algorithms, Symbolic and Algebraic Computation, pp.467-474, 1989.
DOI : 10.1007/3-540-51084-2_44

J. P. Kung, Canonical forms of binary forms: variations on a theme of Sylvester, Institute for Mathematics and Its Applications, vol.19, p.46, 1990.

J. P. Kung and G. Rota, The invariant theory of binary forms, Bulletin of the American Mathematical Society, vol.10, issue.1, pp.27-85, 1984.
DOI : 10.1090/S0273-0979-1984-15188-7

J. M. Landsberg, Tensors: geometry and applications, 2012.
DOI : 10.1090/gsm/128

W. Manthey, U. Helmke, and D. Hinrichsen, Topological aspects of the partial realization problem, Mathematics of Control, Signals, and Systems, vol.41, issue.124, pp.117-149, 1992.
DOI : 10.1007/BF01215842

J. L. Massey, Shift-register synthesis and bch decoding. Information Theory, IEEE Transactions on, vol.15, issue.1, pp.122-127, 1969.

J. M. Mcnamee and V. Y. Pan, Numerical methods for roots of polynomials (II), chapter 15, 2013.

J. Nie, K. Ranestad, and B. Sturmfels, The algebraic degree of semidefinite programming, Mathematical Programming, pp.379-405, 2010.
DOI : 10.1007/s10107-008-0253-6

G. Norton, On the Minimal Realizations of a Finite Sequence, Journal of Symbolic Computation, vol.20, issue.1, pp.93-115, 1995.
DOI : 10.1006/jsco.1995.1040

L. Oeding and G. Ottaviani, Eigenvectors of tensors and algorithms for Waring decomposition, Journal of Symbolic Computation, vol.54, pp.9-35, 2013.
DOI : 10.1016/j.jsc.2012.11.005

V. Pan, Structured matrices and polynomials: unified superfast algorithms, 2001.
DOI : 10.1007/978-1-4612-0129-8

V. Y. Pan, Univariate Polynomials: Nearly Optimal Algorithms for Numerical Factorization and Root-finding, Journal of Symbolic Computation, vol.33, issue.5, pp.701-733, 2002.
DOI : 10.1006/jsco.2002.0531

V. Y. Pan and E. Tsigaridas, Accelerated Approximation of the Complex Roots and Factors of a Univariate Polynomial URL https, Theor. Comput. Sci, 2016.

V. Y. Pan and E. Tsigaridas, Nearly optimal computations with structured matrices URL https, Theor. Comput. Sci, 2016.

B. Reznick, Homogeneous polynomial solutions to constant coefficient pde's. advances in mathematics, pp.179-192, 1996.

B. Reznick, On the Length of Binary Forms, Quadratic and Higher Degree Forms, pp.207-232, 2013.
DOI : 10.1007/978-1-4614-7488-3_8

B. A. Reznick, Sums of even powers of real linear forms, Memoirs of the American Mathematical Society, vol.96, issue.463, 1992.
DOI : 10.1090/memo/0463

J. Sylvester, An essay on canonical forms, supplement to a sketch of a memoir on elimination, transformation and canonical forms, The collected papers of JJ Sylvester, pp.203-216, 1904.

J. Sylvester, On a remarkable discovery in the theory of canonical forms and of hyperdeterminants, The collected papers of JJ Sylvester, pp.265-283, 1904.