Finding finite 𝐵₂-sequences faster

DOI10.1090/S0025-5718-98-00986-7zbMATH Open0902.11013MaRDI QIDQ4396456FDOQ4396456

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

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

Cites Work

• Title not available (Why is that?)
• Theorems in the additive theory of numbers
• On a Problem of Sidon in Additive Number Theory, and on some Related Problems
• Solving a linear equation in a set of integers I
• An inequality for B2-sequences
• Finding Finite B 2 -Sequences with Larger m - a 1/2 m

Cited In (6)

• A translate of Bose-Chowla \(B_2\)-sets
• On Costas sets and Costas clouds
• ON LINEARISED POLYNOMIALS, SIDON ARRAYS AND FAST CONSTRUCTION OF SIDON SETS
• On the complexity of constructing Golomb rulers
• Constructions of generalized Sidon sets.
• A remark on B₂-sequences in GF[p,x]

   Recommendations

• Finding Finite B 2 -Sequences with Larger m - a 1/2 m 👍 👎
• A remark on B₂-sequences in GF[p,x] 👍 👎
• Title not available (Why is that?) 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4396456)