Abstract
In this paper we study a certain generalization of combinatorial designs related to almost difference sets, namely the t-adesign, which was coined by Ding (Codes from difference sets, 2015). It is clear that 2-adesigns are partially balanced incomplete block designs which naturally arise in many combinatorial and statistical problems. We discuss some of their basic properties and give several constructions of 2-adesigns (some of which correspond to new almost difference sets and some to new almost difference families), as well as two constructions of 3-adesigns. We discuss basic properties of the incidence matrices and make an initial investigation into the codes which they generate. We find that many of the codes have good parameters in the sense they are optimal or have relatively high minimum distance.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Andrews G.E.: Number Theory, pp. 128–132. W. B. Saunders, Philadelphia (1971).
Arasu K.T., Ding C., Helleseth T., Kumar P.V., Martinsen H.M.: Almost difference sets and their sequences with optimal autocorrelation. IEEE Trans. Inf. Theory 47, 2934–2943 (2001).
Bose R.C.: A note on fisher’s inequality for balanced incomplete block designs. Ann. Math. Stat. 20(4), 619–620 (1949).
Calderbank R., Kantor W.M.: The geomertry of two-weight codes. Bull. Lond. Math. Soc. 18, 97–122 (1986)
Cusick T.W., Ding C., Renvall A.: Stream Ciphers and Number Theory. Elsevier, North-Holland (1998).
Dembowski P.: Finite Geometries. Springer, New York (1968).
Dickson L.E.: Cyclotomy, higher congruences and \(\text{ W }\)aring’s problem. Am. J. Math. 57, 391–424 (1935).
Ding C.: Cyclic codes from the two-prime sequences. IEEE Trans. Inf. Theory 58(6), 3881–3891 (2012).
Ding C.: Cyclic codes from cyclotomic sequences of order four. Finite Fields Appl. 23, 8–34 (2013).
Ding C.: Codes from Difference Sets, p. 75. World Scientific, Singapore (2015).
Ding C., Yin J.: Constructions of almost difference families. Discret. Math. 308, 4941–4954 (2008).
Ding C., Helleseth T., Martinsen H.: New families of binary sequences with optimal three-level autocorrelation. IEEE Trans. Inf. Theory 47(1), 428–433 (2001).
Ding C., Pott A., Wang Q.: Constructions of almost difference sets from finite fields. Des Codes Cryptogr. 72, 581–592 (2014).
Fisher R.A.: An examination of the different possible solutions of a problem in incomplete blocks. Ann. Eugen. 10, 52–75 (1940).
Grassl M.: Tables for linear codes. Online at http://www.codetables.de.
Hall Jr. M.: A survey of difference sets. Proc. AMS 7, 975–986 (1956).
Hirschfeld J.W.P.: Projective Geometries Over Finite Fields, 2nd edn. Oxford University Press, Oxford (1988).
Huffman W.C., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003).
Nowak K.: A survey on almost difference sets (2014). arXiv:1409.0114v1.
Ogata W., Kurosawa K., Stinson D.R., Saido H.: New combinatorial designs and their applications to authentication codes and secret sharing schemes. Discret. Math. 279, 384–405 (2004).
Rains E.M.: Shadow bounds for self-dual codes. IEEE Trans. Inf. Theory 44(1), 134–139 (1998).
Stinson D.R.: Combinatorial Designs: Constructions and Analysis. Springer, New York (2003).
Tang X.H., Gong G.: New constructions of binary sequences with optimal autocorrelation magnitude/value. IEEE Trans. Inf. Theory 56(3), 1278–1286 (2010).
Whiteman A.L.: The cyclotomic numbers of order ten. Acta Arith. 10, 95–111 (1960).
Yu N.Y., Gong G.: New binary sequences with optimal autocorrelation. IEEE Trans. Inf. Theory 54(10), 4771–4779 (2008).
Zhang Y., Lei J.G., Zhang S.P.: A new family of almost difference sets and some necessary conditions. IEEE Trans. Inf. Theory 52(5), 2052–2061 (2006).
Acknowledgments
We would like to thank the anonymous referees for the valuable and insightful comments which helped us to improve this paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by A. Pott.
Rights and permissions
About this article
Cite this article
Michel, J., Ding, B. A generalization of combinatorial designs and related codes. Des. Codes Cryptogr. 82, 511–529 (2017). https://doi.org/10.1007/s10623-016-0179-6
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-016-0179-6