A family of perpendicular arrays achieving perfect 4-fold secrecy (Q1322248): Difference between revisions
From MaRDI portal
Removed claims |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Juergen Bierbrauer / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Ding-Zhu Du / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An infinite class of 4-designs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new family of 4-designs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A family of 4-designs with block size 9 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3781132 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3197833 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some perpendicular arrays for arbitrarily large \(t\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The combinatorics of authentication and secrecy codes / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(94)90144-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2083315922 / rank | |||
Normal rank |
Latest revision as of 11:03, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A family of perpendicular arrays achieving perfect 4-fold secrecy |
scientific article |
Statements
A family of perpendicular arrays achieving perfect 4-fold secrecy (English)
0 references
14 November 1994
0 references
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\).
0 references
perpendicular array
0 references