Wieferich pairs and Barker sequences
DOI10.1007/s10623-009-9301-3zbMath1228.11032OpenAlexW2097099020MaRDI QIDQ1039268
Publication date: 27 November 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-009-9301-3
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Congruences; primitive roots; residue systems (11A07) Special sequences and polynomials (11B83) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (14)
Uses Software
Cites Work
- Unnamed Item
- A new restriction on the lengths of Golay complementary sequences
- Wieferich pairs and Barker sequences
- A note on the nonexistence of Barker sequences
- Barker sequences and difference sets
- Characters and cyclotomic fields in finite geometry
- A class number free criterion for Catalan's conjecture.
- The field descent method
- Character sums and difference sets
- Cyclic difference sets
- New Solutions of a p - 1 ≡1 (mod p 2 )
- Barker sequences and flat polynomials
- Odd perfect numbers have at least nine distinct prime factors
- The First Case of Fermat's Last Theorem is True for all Prime Exponents up to 714,591,416,091,389
- On Fermat's Quotient, Base Two
- Cyclotomic integers and finite geometry
- On the 𝑝-divisibility of Fermat quotients
- Solutions of the congruence 𝑎^{𝑝-1}≡1 (mod 𝑝^{𝑟})
- The continuing search for Wieferich primes
- Primary cyclotomic units and a proof of Catalans conjecture
- Irreducible polynomials and barker sequences
- Enumeration of the Elementary Circuits of a Directed Graph
- A note on multipliers of difference sets
- A search for Wieferich and Wilson primes
- On Binary Sequences
This page was built for publication: Wieferich pairs and Barker sequences