A new family of almost difference sets and some necessary conditions

DOI10.1109/TIT.2006.872969MaRDI QIDQ3547883zbMATH OpenFDO

Authors Yuan Zhang, Shaopu Zhang, Jianguo Lei

Publication date 21 December 2008

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

Full work available at URL https://doi.org/10.1109/TIT.2006.872969

zbMATH Keywords

applicationscoding theorycryptographydifference sets

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Cryptography (94A60) Combinatorial codes (94B25)

Recommendations

• Constructions of almost difference sets from finite fields
• Almost difference sets and their sequences with optimal autocorrelation
• Some new almost difference families with k=6, 7, 8, 9
• Constructions of \((q,K,\lambda, t,Q)\) almost difference families
• A note on almost difference sets in nonabelian groups

Cited in

(22)

• Some necessary conditions on the parameters of partial difference sets
• 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
• When almost all sets are difference dominated
• Almost difference sets and their sequences with optimal autocorrelation
• 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
• Linear complexity of generalized cyclotomic sequences with period 2ᵐp^n
• A note on cyclic almost difference families
• Optimal difference systems of sets and partition-type cyclic difference packings
• Constructions of divisible difference sets, almost difference sets and special partial direct product difference sets from binary sequences
• 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\)

This page was built for publication: A new family of almost difference sets and some necessary conditions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547883)