nach oben

Designs, Codes and Cryptography

Erschienen in:

30.08.2016

Near-complete external difference families

verfasst von: James A. Davis, Sophie Huczynska, Gary L. Mullen

Erschienen in: Designs, Codes and Cryptography | Ausgabe 3/2017

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

We introduce and explore near-complete external difference families, a partitioning of the nonidentity elements of a group so that each nonidentity element is expressible as a difference of elements from distinct subsets a fixed number of times. We show that the existence of such an object implies the existence of a near-resolvable design. We provide examples and general constructions of these objects, some of which lead to new parameter families of near-resolvable designs on a non-prime-power number of points. Our constructions employ cyclotomy, partial difference sets, and Galois rings.

Vorheriger Artikel Construction of low-hit-zone frequency hopping sequences with optimal partial Hamming correlation by interleaving techniques

Nächster Artikel Higher order differentiation over finite fields with applications to generalising the cube attack

Beth T., Jungnickel D., Lenz H.: Design Theory. Cambridge University Press, Cambridge (1999).CrossRefMATH

Chang Y., Ding C.: Constructions of external difference families and disjoint difference families. Des. Codes Cryptogr. 40, 167–185 (2006).MathSciNetCrossRefMATH

Colburn C., Dinitz J.: Handbook of Combinatorial Designs. Chapman Hall, CRC Press, Boca Raton (2007).

Davis J.A., Polhill J.: Difference set constructions of DRADs and association schemes. J. Comb. Theory A 117, 598–605 (2010).MathSciNetCrossRefMATH

Fuji-Hara R., Munemasa A., Tonchev V.: Hyperplane partitions and difference systems of sets. J. Comb. Theory A 113, 1689–1698 (2006).MathSciNetCrossRefMATH

Hammons A.R., Kumar P.V., Calderbank A.R., Sloane N.J.A., Sole P.: The \({\mathbb{Z}}_4\)-linearity of Kerdock, Preparata, Goethals, and related codes. IEEE Trans. Inf. Theory 40, 301–319 (1994).MathSciNetCrossRefMATH

Lander E.: Symmetric Designs: An Algebraic Approach. Cambridge University Press, Cambridge (1983).CrossRefMATH

Leung K.H., Ma S.L.: Partial difference sets with Paley parameters. Bull. Lond. Math. Soc. 27, 553–564 (1995).MathSciNetCrossRefMATH

Levenshtein V.I.: One method of constructing quasilinear codes providing synchronization in the presence of errors. Probl. Inf. Transm. 7, 215–222 (1971).

10.

Lidl R., Niederreiter H.: Finite Fields. Cambridge University Press, Cambridge (1997).MATH

11.

Mullen G., Panario D.: Handbook of Finite Fields. Chapman Hall, CRC Press, Boca Raton (2013).CrossRefMATH

12.

Mutoh Y., Tonchev V.: Difference systems of sets and cyclotomy. Discrete Math. 308, 2959–2969 (2008).MathSciNetCrossRefMATH

13.

Ng S.-L., Paterson M.B.: Disjoint difference families and their applications. Des. Codes Cryptogr. 78, 103–127 (2016).MathSciNetCrossRefMATH

14.

Ogata W., Kurosawa K., Stinson D., Saido H.: New combinatorial designs and their applications to authentication codes and secret sharing schemes. Discrete Math. 279, 383–405 (2004).MathSciNetCrossRefMATH

15.

Polhill J.: Paley type partial difference sets in non \(p\)-groups. J. Comb. Theory A 117, 1027–1036 (2010).MathSciNetCrossRefMATH

16.

Polhill J., Davis J.A., Smith K.: A new product construction for partial difference sets. Des. Codes Cryptogr. 68, 155–161 (2013).MathSciNetCrossRefMATH

17.

Pott A.: Finite Geometry and Character Theory. Springer Lecture Notes in Mathematics, Berlin (1995).

18.

Wilson R.M.: Cyclotomy and difference families in elementary abelian groups. J. Number Theory 4, 17–42 (1972).MathSciNetCrossRefMATH

Titel: Near-complete external difference families
verfasst von: James A. Davis
Sophie Huczynska
Gary L. Mullen
Publikationsdatum: 30.08.2016
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 3/2017
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-016-0275-7

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Weitere Artikel der Ausgabe 3/2017

Quantum MDS codes with relatively large minimum distance from Hermitian self-orthogonal codes

Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes

Galois self-dual constacyclic codes

Cryptanalysis of multilinear maps from ideal lattices: revisited

Classification of partial difference sets in Abelian groups of order

The BEL-rank of finite semifields