On \((n,k)\)-sequences

DOI10.1016/S0166-218X(00)00183-9zbMath0971.05032MaRDI QIDQ1582080

Hong-Yeop Song, June Bok Lee

Publication date: 30 October 2001

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

permutationdifference triangles\((n,k)\)-sequenceFlorentine and Vatican arraysfrequency hopping codessingly periodic Costas sequence

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Special sequences and polynomials (11B83)

Related Items

Circular Tuscan-\(k\) arrays from permutation binomials

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tuscan-K squares
• A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
• Florentine rows or left-right shifted permutation matrices with cross- correlation values \(\leq 1\)
• The existence of circular Florentine arrays
• On the nonperiodic cyclic equivalence classes of Reed-Solomon codes
• Families of sequences with optimal Hamming-correlation properties