Existence of APAV\((q,k)\) with \(q\) a prime power \(\equiv 5 \pmod 8\) and \(k\equiv 1 \pmod 4\).

DOI10.1016/S0012-365X(03)00265-6zbMath1047.94013MaRDI QIDQ1428519

Dian-Hua Wu, Zhen Fu Cao, Ke-jun Chen

Publication date: 29 March 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Finite fieldWeil's theoremAuthentication perpendicular array vectorMultiplicative characterPerpendicular array

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

Combinatorial designs and the theorem of Weil on multiplicative character sums

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Steiner pentagon systems
• A construction for authentication/secrecy codes from 3-homogeneous permutation groups
• The combinatorics of authentication and secrecy codes
• Some constructions and bounds for authentication codes
• A construction for authentication/secrecy codes from certain combinatorial designs
• On the maximal number of pairwise orthogonal Steiner triple systems
• Existence of \((q,6,1)\) difference families with \(q\) a prime power
• On cyclically resolvable cyclic Steiner 2-designs
• \(V (m, t)\)'s for \(m = 4, 5, 6\)
• Existence of Steiner seven-cycle systems
• An existence theorem for cyclic triplewhist tournaments
• Authentication perpendicular arrays APA1(2, 7, ?)
• Existence of (q, 7, 1) difference families with q a prime power
• Theory of perpendicular arrays
• \(V(m,t)\) and its variants

This page was built for publication: Existence of APAV\((q,k)\) with \(q\) a prime power \(\equiv 5 \pmod 8\) and \(k\equiv 1 \pmod 4\).