Classifying generalized Howell designs
Loading...
Access rights
openAccess
CC BY
CC BY
publishedVersion
URL
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Unless otherwise stated, all rights belong to the author. You may download, display and print this publication for Your own personal use. Commercial use is prohibited.
Authors
Date
Major/Subject
Mcode
Degree programme
Language
en
Pages
12
Series
Designs, Codes and Cryptography, Volume 93, issue 11, pp. 4659-4670
Abstract
A t-GHDk(s,v;λ) generalized Howell design is an s×s array, each cell of which is either empty or contains a k-subset of elements of some set X of size v such that (i) each element of X appears exactly once in each row and in each column and (ii) no t-subset of elements from X appears in more than λ cells. Computer-aided classification of such designs is here considered in the framework of permutation codes with specific properties. Among other things, it is shown that a 2-GHD3(7,18;1) exists and is unique; this settles the existence problem for 2-GHD3(n+1,3n;1).Description
Publisher Copyright: © The Author(s) 2025.
Other note
Citation
Östergård, P R J 2025, 'Classifying generalized Howell designs', Designs, Codes and Cryptography, vol. 93, no. 11, pp. 4659-4670. https://doi.org/10.1007/s10623-025-01694-w