A Theory of Ternary Complementary Pairs

@article{Craigen2001ATO,
  title={A Theory of Ternary Complementary Pairs},
  author={R. Craigen and C. Koukouvinos},
  journal={J. Comb. Theory, Ser. A},
  year={2001},
  volume={96},
  pages={358-375}
}
Sequences with zero autocorrelation are of interest because of their use in constructing orthogonal matrices and because of applications in signal processing, range finding devices, and spectroscopy. Golay sequences, which are pairs of binary sequences (i.e., all entries are ±1) with zero autocorrelation, have been studied extensively, yet are known only in lengths 2a10b26c. Ternary complementary pairs are pairs of (0, ±1)-sequences with zero autocorrelation (thus, Golay pairs are ternary… Expand
Boolean and ternary complementary pairs
  • R. Craigen
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. A
  • 2003
TLDR
An exhaustive survey of pairs of small lengths and construct some infinite classes clearly of fundamental importance in the theory, which completely characterize all pairs of even weight and give a product construction for pairs of odd weight that gives a greater variety of new pairs than similar product methods used in the ternary case. Expand
Further results on ternary complementary sequences, orthogonal designs and weighing matrices
A set of sequences is complementary, if the sum of their periodic or nonperiodic autocorrelation function is zero. Infinite families of orthogonal designs, based on some weighing matrices of orderExpand
Generation and correlation algorithms for ternary complementary pairs of sequences of length 3·2n
TLDR
Algorithms for generating and performing the correlation of ternary complementary pairs using a minimum amount of calculations are described, making it possible to attain a wider range of lengths, and, as a consequence, a widerrange of noise immunity in some applications. Expand
Good code sets
  • A. Fam
  • Computer Science, Mathematics
  • 2011 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)
  • 2011
TLDR
A new class of sparse mutually orthogonal optical codes is introduced, based on defining the separation between nonzero elements via logarithms of powers of prime numbers, particularly suited for soliton based optical codes. Expand
Good code sets by spreading orthogonal vectors via Golomb rulers and Costas arrays
  • A. Fam
  • Mathematics
  • 2010 IEEE Radar Conference
  • 2010
Good code sets have autocorrelation functions ACF with small sidelobes, and also have small crosscorrelations. In this work, a class of good ternary codes sets are introduced. First, mutuallyExpand
Further explorations into ternary complementary pairs
TLDR
This paper investigates patterns among those lengths and weights that are within easy computational distance from the last length considered therein, length 14, and provides support for the previous conjectures, and shed enough new light to speculate further as to the likely ultimate shape of the theory. Expand
Contemporary Mathematics What can be used instead of a Barker sequence ?
A classical problem of digital sequence design, first studied in the 1950s but still not well understood, is to determine long binary sequences for which the absolute values of the aperiodicExpand
Generalised Complementary Arrays
TLDR
This work presents a generalised setting for the construction of complementary array pairs and its proof, using unitary matrix notation, and derives closed-form Boolean formulas for these cases. Expand
A multi-dimensional approach to the construction and enumeration of Golay complementary sequences
TLDR
This process greatly simplifies previous approaches, by separating the construction of Golay arrays from the enumeration of all possible projections of these arrays to lower dimensions. Expand
ON THE COMPUTATION OF THE NON-PERIODIC AUTOCORRELATION FUNCTION OF TWO TERNARY SEQUENCES AND ITS RELATED COMPLEXITY ANALYSIS
We establish a new formalism of the non-periodic autocorrelation function (NPAF) of two sequences, which is suitable for the computation of the NPAF of any two sequences. It is shown, that thisExpand
...
1
2
3
...

References

SHOWING 1-10 OF 23 REFERENCES
Boolean and ternary complementary pairs
  • R. Craigen
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. A
  • 2003
TLDR
An exhaustive survey of pairs of small lengths and construct some infinite classes clearly of fundamental importance in the theory, which completely characterize all pairs of even weight and give a product construction for pairs of odd weight that gives a greater variety of new pairs than similar product methods used in the ternary case. Expand
Complex Golay sequences: structure and applications
TLDR
It is shown how to construct a large variety of sets of four complex sequences with zero autocorrelation, suitable for the construction of various matrices such as Hadamard matrices, complex Hadamards matrices and signed group HadamARD matrices over the dihedral signed group. Expand
Multiplications of ternary complementary pairs
TLDR
This paper presents a computer-search method for concatenating or "multiplying" binary or ternary complementary pairs, and some applications and numerical consequences are shown. Expand
On Golay sequences
TLDR
It is proved that Golay sequences of length n = 2 · 7 2 t do not exist and new proofs of some known results are given and conjecture that there are no Golays of length 2 · q 2 t where q is not the sum of two integer squares. Expand
New weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function – a review
Abstract The book, Orthogonal Designs : Quadratic Forms and Hadamard Matrices , Marcel Dekker, New York-Basel, 1979, by A.V. Geramita and Jennifer Seberry, has now been out of print for almost twoExpand
On ternary complementary pairs
TLDR
A variety of new constructions which concatenate shorter groups of sequences to obtain longer sequences to give many new restrictions on TCP's of lengths £ and deficiencies 8 = 2x, where x == £ mod 4. Expand
Polyphase complementary codes
  • R. Frank
  • Computer Science
  • IEEE Trans. Inf. Theory
  • 1980
TLDR
A number of new results are presented including additional kernels and lengths of polyphase complementary codes, including complementary Barker codes, and a table of known lengths of pairs, triads and quads of sequences is given. Expand
An Introduction to the Theory of Numbers
This is the fifth edition of a work (first published in 1938) which has become the standard introduction to the subject. The book has grown out of lectures delivered by the authors at Oxford,Expand
An Introduction to the Theory of Numbers
THIS book must be welcomed most warmly into X the select class of Oxford books on pure mathematics which have reached a second edition. It obviously appeals to a large class of mathematical readers.Expand
On ternary complementary sequences
TLDR
A new family of complementary pairs of sequences over the alphabet /spl alpha//sub 3/=+{1,-1,0}. Expand
...
1
2
3
...