Constructions of partitioned difference families

DOI10.1016/j.ejc.2007.06.006zbMath1145.05010OpenAlexW2027125249MaRDI QIDQ932833

Xiuling Shan, Jianxing Yin, Zi Hong Tian

Publication date: 11 July 2008

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2007.06.006

zbMATH Keywords

codespartitioned difference familiespdf

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Combinatorial aspects of packing and covering (05B40)

Related Items (9)

Three classes of partitioned difference families and their optimal constant composition codes ⋮ Disjoint difference families from Galois rings ⋮ Optimal FHSs and DSSs via near zero-difference balanced functions ⋮ The preimage distributions of a class of zero-difference balanced functions and their partitioned difference families ⋮ New 2-designs from strong difference families ⋮ Partitioned difference families and almost difference sets ⋮ Tiling groups with difference sets ⋮ Generic constructions for partitioned difference families with applications: a unified combinatorial approach ⋮ Perfect difference systems of sets and the unit group of \(Z_{p^n}\)

Cites Work

• Unnamed Item
• Unnamed Item
• Constructions of external difference families and disjoint difference families
• Constructions of almost difference families
• New combinatorial designs and their applications to authentication codes and secret sharing schemes.
• On constant composition codes
• Cyclotomy and difference families in elementary Abelian groups
• Partitions of difference sets and code synchronization
• Combinatorial Constructions of Optimal Constant-Composition Codes
• On constant-composition codes over Z/sub q/
• Almost difference sets and their sequences with optimal autocorrelation
• Combinatorial problems motivated by comma‐free codes

This page was built for publication: Constructions of partitioned difference families