Existence of APAV\((q,k)\) with \(q\) a prime power \(\equiv 5 \pmod 8\) and \(k\equiv 1 \pmod 4\).
type: Item
instance of: scholarly article
title: Existence of APAV\((q,k)\) with \(q\) a prime power \(\equiv 5 \pmod 8\) and \(k\equiv 1 \pmod 4\).
zbMATH Open document ID: 1047.94013
DOI: 10.1016/S0012-365X(03)00265-6
published in: Discrete Mathematics
publication date: 2004-03-29T00:00:00Z
Mathematics Subject Classification ID: 94A62
Mathematics Subject Classification ID: 11T71
zbMATH DE Number: 2062785
zbMATH Keywords: Perpendicular array
zbMATH Keywords: Authentication perpendicular array vector
zbMATH Keywords: Finite field
zbMATH Keywords: Multiplicative character
zbMATH Keywords: Weil's theorem
author: Kejun Chen
author: Zhenfu Cao
author: Dianhua Wu
MaRDI profile type: Publication
cites work: Existence of Steiner seven-cycle systems
cites work: An existence theorem for cyclic triplewhist tournaments
cites work: Theory of perpendicular arrays
cites work: \(V(m,t)\) and its variants
cites work: Existence of (q, 7, 1) difference families with q a prime power
cites work: Existence of \((q,6,1)\) difference families with \(q\) a prime power
cites work: Q4244124
cites work: Q4221880
cites work: Authentication perpendicular arrays APA1(2, 7, ?)
cites work: Q3358739
cites work: On the maximal number of pairwise orthogonal Steiner triple systems
cites work: Q3197833
cites work: On cyclically resolvable cyclic Steiner 2-designs
cites work: Q3216750
cites work: Steiner pentagon systems
cites work: \(V (m, t)\)'s for \(m = 4, 5, 6\)
cites work: Q4887952
cites work: Q3905297
cites work: A construction for authentication/secrecy codes from certain combinatorial designs
cites work: Some constructions and bounds for authentication codes
cites work: The combinatorics of authentication and secrecy codes
cites work: A construction for authentication/secrecy codes from 3-homogeneous permutation groups
cites work: Q4352950
description: scientific article; zbMATH DE number 2062785