Abstract
In direct spread CDMA systems, codebooks meeting the Welch bounds are used to distinguish among the signals of different users. Recently, constructions of codebooks with difference sets meeting Welch’s bound on the maximum cross-correlation amplitude were developed. In this paper, a generic construction of codebooks using almost difference sets is considered and several classes of codebooks nearly meeting the Welch bound are obtained. The parameters of the codebooks constructed in this paper are new.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arasu K.T., Ding C., Helleseth T., Kumar P.V., Martinsen H. (2001). Almost difference sets and their sequences with optimal autocorrelation. IEEE Trans. Inform. Theory 47(7): 2834–2843
Baumert L.D. (1971). Cyclic Difference Sets, Lecture Notes in Mathematics, vol 182. Springer, Berlin
Beth T., Jungnickel D., Lenz H. (1999). Design Theory. Cambridge University Press, Cambridge
Calderbank A.R., Cameron P.J., Kantor W.M., Seidel J.J. (1997). Z 4-Kerdock codes, orthogonal spreads, and extremal Euclidean line-sets. Proc. London Math. Soc. 75(3): 436–480
Conway J.H., Harding R.H., Sloane N.J.A. (1996). Packing lines, planes, etc.: packings in Grassmannian spaces. Exp. Math. 5(2): 139–159
Delsarte P., Goethals J.M., Seidel J.J. (1977). Spherical codes and designs. Geom. Dedicate 67(3): 363–388
Ding C. (1998). Autocorrelation values of the generalized cyclotomic sequences of order 2. IEEE Trans. Inform. Theory 44: 1698–1702
Ding C. (2006). Complex codebooks from combinatorial designs. IEEE Trans. Inform. Theory 52(9): 4229–4235
Ding C., Feng T.: A generic construction of complex codebooks meeting the Welch bound. IEEE Trans. Inform. Theory 11 (2007), to appear.
Ding C., Golin M., Kløve T. (2003). Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets. Des. Codes Cryptogr. 30: 73–84
Ding C., Helleseth T., Martinsen H.M. (2001). New families of binary sequences with optimal three-level autocorrelation. IEEE Trans. Inform. Theory 47: 428–433
Ding C., Yuan J. (2006). A family of skew Paley-Hadamard difference sets. J. Comb. Theory A 113(7): 1526–1535
Karystinos G.N., Pados D.A. (2003). New bounds on the total-squared-correlation and perfect design of DS-CDMA binary signature sets. IEEE Trans. Commun. 3: 260–265
König H.: Cubature formulas on spheres. In: Advances in Multivarate Approximation, pp. 201–211. Wiley, New York (1979).
Ipatov V.P. (2004). On the Karystinos–Pados bounds and optimal binary DS-CDMA signature ensambles. IEEE Comm. Lett. 8(2): 81–83
Lempel A., Cohn M., Eastman W.L. (1997). A class of binary sequences with optimal autocorrelation properties. IEEE Trans. Inform. Theory 23: 38–42
Love D.J., Heath R.W., Strohmer T. (2003). Grassmannian beamingforming for multiple-input multiple-output wireless systems. IEEE Trans. Inform. Theory 49(10): 2735–2747
Massey J.L., Mittelholzer T.: Welch’s bound and sequence sets for code-division multiple-access systems. In: Sequences II: Methods in Communication, Security and Computer Science, pp. 63–78. Springer, Heidelberg and New York (1993).
Pott A. (1995). Finite Geometry and Character Theory. Lecture Notes in Mathematics, vol 1601. Springer, Berlin
Sarwate D.: Meeting the Welch bound with equality. In: Sequences and their Applications, Proc. of SETA’ 98, pp. 79–102. Springer, London (1999).
Sidelnikov V.M.: Some k-valued pseudo-random sequences and nearly equidistant codes. Probl. Inform. Trans. 5(1), 12–16.
Golomb S.W.: Cyclic Hadamard difference sets—constructions and applications, in: Sequences and their Applications. Proc. of SETA’ 98, pp. 39–48. Springer, London (1999).
Strohmer T., Heath Jr. R.W. (2003). Grassmannian frames with applications to coding and communication. Appl. Comput. Harmonic Anal. 14(3): 257–275
Welch L. (1974). Lower bounds on the maximum cross correlation of signals. IEEE Trans. Inform. Theory 20(3): 397–399
Whiteman A.L. (1962). A family of difference sets. Illinois J. Math. 6: 107–121
Wootters W., Fields B. (2005). optimal state-determination by mutually unbiased measurements. Ann. Phys. 191(2): 363–381
Xia P., Zhou S., Giannakis G.B. (2005). Achieving the Welch bound with difference sets. IEEE Trans. Inform. Theory 51(5): 1900–1907
Xiang Q. (1999). Recent results on difference sets with classical parameters. In: Pott A., Kumar P.V., Helleseth T., Jungnickel D. (eds) Difference Sets, Sequences and their Correlation Properties. Kluwer, Amsterdam, pp. 419–434
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by J. Jedwab.
Rights and permissions
About this article
Cite this article
Ding, C., Feng, T. Codebooks from almost difference sets. Des. Codes Cryptogr. 46, 113–126 (2008). https://doi.org/10.1007/s10623-007-9140-z
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-007-9140-z