Classification of semiregular relative difference sets withgcd(,n)=1 attaining Turyn's bound

DESIGNS CODES AND CRYPTOGRAPHY(2024)

引用 0|浏览0
暂无评分
摘要
Suppose a(lambda n,n,lambda n,lambda)relative difference set exists in an abelian groupG=SxH,where|S|=lambda,|H|=n(2),gcd(lambda,n)=1, and lambda is self-conjugate modulo lambda n.Then lambda is a square,say lambda=u(2),andexp(S)dividesuby Turyn's exponent bound. We classify all such relativedifference sets with exp(S)=u. We also show thatnmust be a prime power if an abelian(lambda n,n,lambda n,lambda)RDS with gcd(lambda,n)=1 exists and lambda is self-conjugate modulon
更多
查看译文
关键词
Exponent bound,Direct product difference sets,Projective planes
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要