Finding finite 𝐵₂-sequences faster

DOI10.1090/S0025-5718-98-00986-7zbMath0902.11013MaRDI QIDQ4396456

Bernt Lindström

Publication date: 14 June 1998

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

zbMATH Keywords

finite fieldprimitive elementSidon sequence\(B_2\)-sequenceprimitive quadraticBose-Chowla theorem

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Finite fields (field-theoretic aspects) (12E20) Special sequences and polynomials (11B83) Calculation of integer sequences (11Y55)

Related Items (4)

ON LINEARISED POLYNOMIALS, SIDON ARRAYS AND FAST CONSTRUCTION OF SIDON SETS ⋮ On Costas sets and Costas clouds ⋮ Constructions of generalized Sidon sets. ⋮ On the complexity of constructing Golomb rulers

Cites Work

• Unnamed Item
• Theorems in the additive theory of numbers
• Solving a linear equation in a set of integers I
• Finding Finite B 2 -Sequences with Larger m - a 1/2 m
• An inequality for B2-sequences
• On a Problem of Sidon in Additive Number Theory, and on some Related Problems

This page was built for publication: Finding finite 𝐵₂-sequences faster