Corpus ID: 118629952

Algorithms for searching for normal and near- Yang sequences

@inproceedings{Gysin1993AlgorithmsFS,
  title={Algorithms for searching for normal and near- Yang sequences},
  author={Marc Gysin},
  year={1993}
}
This thesis is about normal and near-Yang sequences. An original definition of near-Yang sequences is included. After a short overview of the mathematical background of normal and near-Yang sequences, different algorithms for searching for these sequences are described. These algorithms can be divided in two groups: exhaustive search algorithms and heuristic search algorithms. One of the most important heuristic search algorithms is the simulated annealing algorithm. The following new results… Expand
On sequences with zero autocorrelation
New normal sequences of length 25

References

SHOWING 1-10 OF 10 REFERENCES
The Annealing Algorithm
Solving Substitution Ciphers Using the Method of Simulated Annealing
  • Honours Thesis, The University of New England,
  • 1992
Turyn sequences, M.Sc. Thesis, The University of New South Wales, Australian Defence
  • Force Academy, Canberra,
  • 1991
Further results on base sequences, disjoint complementary sequences, OD{At\t,t^t^t) and the excess of Hadamard matrices
  • Ars Combinatoria,
  • 1990
Stinson Hill-climbing algorithms for the construction of combinatorial designs
  • Annals of Discrete Mathematics,
  • 1985