Littlewood polynomials with high order zeros

DOI10.1090/S0025-5718-06-01848-5zbMath1155.11313MaRDI QIDQ5470069

Shahar Golan, Daniel Berend

Publication date: 29 May 2006

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

restricted coefficientsminimal length of a polynomial

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Polynomials in number theory (11C08) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)

Related Items (4)

On polynomials with only rational roots ⋮ Minesweeper on graphs ⋮ Equal moments division of a set ⋮ Littlewood polynomials, spectral-null codes, and equipowerful partitions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectral-null codes and null spaces of Hadamard submatrices
• On a problem of Byrnes concerning polynomials with restricted coefficients
• Efficient encoding algorithm for third-order spectral-null codes
• On a problem of Byrnes concerning polynomials with restricted coefficients, II

This page was built for publication: Littlewood polynomials with high order zeros