A new family of almost difference sets and some necessary conditions

DOI10.1109/TIT.2006.872969zbMath1236.05037MaRDI QIDQ3547883

Yuan Zhang, Shao-Pu Zhang, Jian Guo Lei

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

cryptography; applications; difference sets; coding theory

Mathematics Subject Classification ID

94A60: Cryptography

05B10: Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.)

94B25: Combinatorial codes

Related Items

Unnamed Item, New \((q,K,\lambda)\)-ADFs via cyclotomy, A general construction of binary interleaved sequences of period \(4{N}\) with optimal autocorrelation, A generalization of combinatorial designs and related codes, A note on cyclic almost difference families, Optimal difference systems of sets and partition-type cyclic difference packings, The existence of almost difference families, Construction of cyclotomic codebooks nearly meeting the Welch bound, The existence of \((q,k,\lambda ,t)\)-ADFs for \(k=4,5,6\), A note on almost difference sets in nonabelian groups, New optimal binary sequences with period \(4p\) via interleaving Ding-Helleseth-Lam sequences, Square \((1,-1)\)-matrices with large determinants and near-Hadamard matrices, Constructions of almost difference sets from finite fields, Constructions of \((q,K,\lambda, t,Q)\) almost difference families, Almost designs and their links with balanced incomplete block designs, Partial geometric designs from group actions, Discrete linear models for the generalized self-shrunken sequences, Almost difference sets in nonabelian groups