A family of perpendicular arrays achieving perfect 4-fold secrecy
type: Item
instance of: scholarly article
title: A family of perpendicular arrays achieving perfect 4-fold secrecy
zbMATH Open document ID: 0799.05009
DOI: 10.1016/0012-365X(94)90144-9
published in: Discrete Mathematics
publication date: 1994-11-14T00:00:00Z
review text: A perpendicular array \(\text{PA}_ \lambda(t,k,v)\) is a \(\lambda{v\choose t}\) by \(k\) array of \(t\) distinct symbols, satisfying that (1) every row has \(k\) distinct symbols, and (2) for any \(t\) columns and for any \(t\) distinct symbols, there exist exactly \(\lambda\) rows with the given symbols in the given columns. A perpendicular array \(\text{PA}_ \lambda(t,k,v)\) is inductive if it is also a \(\text{PA}_{\lambda(s)}(t,k,v)\) for any \(s< t\), where \(\lambda(s)= \lambda{v-s\choose t-s}\Bigl/{t\choose s}\). In this paper, the author constructed inductive PAs for \(t= 4\).
Mathematics Subject Classification ID: 05B15
zbMATH DE Number: 562647
zbMATH Keywords: perpendicular array
author: Jürgen Bierbrauer
reviewed by: Du Ding-Zhu
MaRDI profile type: Publication
cites work: An infinite class of 4-designs
cites work: A new family of 4-designs
cites work: A family of 4-designs with block size 9
cites work: Q3781132
cites work: Q3197833
cites work: Some perpendicular arrays for arbitrarily large \(t\)
cites work: The combinatorics of authentication and secrecy codes
full work available at URL: 0012-365x(94)90144-9
OpenAlex ID: W2083315922
description: scientific article; zbMATH DE number 562647