Perfect difference systems of sets and Jacobi sums

DOI10.1016/j.disc.2008.11.009zbMath1191.05025OpenAlexW1981771352MaRDI QIDQ1043561

Koji Momihara, Mieko Yamada, Ryoh Fuji-Hara

Publication date: 9 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2008.11.009

zbMATH Keywords

Jacobi sumscyclotomic cosetsdifference systems of setscodes for synchronization

Mathematics Subject Classification ID

Cryptography (94A60) Other designs, configurations (05B30) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Sequences (mod (m)) (11B50) Combinatorial aspects of packing and covering (05B40)

Related Items (6)

Computational Results for Regular Difference Systems of Sets Attaining or Being Close to the Levenshtein Bound ⋮ Difference systems of sets with size 2 ⋮ Optimal difference systems of sets and difference sets ⋮ Perfect difference systems of sets and the unit group of \(Z_{p^n}\) ⋮ Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families ⋮ Difference systems of sets and a collection of 3-subsets in a finite field of order \(p\)

Cites Work

• Constructions of external difference families and disjoint difference families
• Hyperplane partitions and difference systems of sets
• Difference systems of sets and cyclotomy
• Supplementary difference sets and Jacobi sums
• New combinatorial designs and their applications to authentication codes and secret sharing schemes.
• An algorithm for optimal difference systems of sets
• Partitions of difference sets and code synchronization
• Comma-Free Codes
• Codes Which Detect Deception
• Combinatorial problems motivated by comma‐free codes
• Combinatorial Constructions for Optimal Splitting Authentication Codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Perfect difference systems of sets and Jacobi sums