Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T21:38:48.834Z Has data issue: false hasContentIssue false

Recursive constructions for equidistant permutation arrays

Published online by Cambridge University Press:  09 April 2009

S. A. Vanstone
Affiliation:
University of Waterloo, Waterloo, Ontario
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

An equidistant permutation array (EPA) is a ν × r array defined on an r-set, R, such that (i) each row is a permutation of the elements of R and (ii) any two distinct rows agree in λ positions (that is, the Hamming distance is (r−λ)).

Such an array is said to have order ν. In this paper we give several recursive constructions for EPA's.

The first construction uses a resolvable regular pairwise balanced design of order v to construct an EPA of order ν. The second construction is a generalization of the direct product construction for Room squares.

We also give a construction for intersection permutation arrays, which arrays are a generalization of EPA's.

MSC classification

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1977