Abstract
An optical orthogonal code, with λ=1 is a family, of size l, of w-sets of integers modulo n in which no difference is repeated. If all the differences modulo n appear then this code coincide with the well known design called difference family and the code is called perfect. It is clear that if l(w−1)w≤n−1<(l+1)(w−1)w then no more w-sets can be added to the code and hence the code is optimal. We give some new constructions for difference families and also constructions of optimal codes which are not difference families.
This research was supported in part by the fund of promotion of research at the Technion
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
N. Q. A, L. Gyorfi, and J. L. Massey. Constructions of binary constant-weight cyclic codes and cyclically permutable codes. IEEE Trans. on Inform. Theory, IT-38:940–949, May 1992.
S. Bitan and T. Etzion. Constructions for optimal constant weight cyclically permutable codes and difference families preprint, 1993.
R.C. Bose. On the construction of balanced incomplete block designs. Ann. Eugenics, 9:353–399, 1939.
E. F. Brickell and V.K. Wei. Optical orthogonal codes and difference families. In Proc. of the Southeastern Conference on Combinatorics Graph Theory and Algorithms. 1987.
M.J. Colbourn and C.J. Colbourn. On cyclic block designs. Math. Report of Canadian Academy of Science, 2:21–26, 1980.
H. Chung and P.V. Kumar. Optical orthogonal codes — new bounds and an optimal construction. IEEE Transactions on Information Theory, 36(4):866–873, July 1990.
F. R.K. Chung, J.A. Salehi, and V.K. Wei. Optical orthogonal codes:design, analysis, and applications. IEEE Transactions on Information Theory, 35(3):595–604, May 1989.
S.W. Golomb. Digital communication with space application. Prentice Hall, Englewood Cliff, N.J., Penisula Publishing, Los Altos, CA. 1982, second edition, 1964.
R. Mathon. Constructions for cyclic steiner 2-designs. Annals of Discrete Mathematics, 34:353–362, 1987.
J. L. Massey and P. Mathys. The collision channel without feedback. IEEE Trans. on Inform. Theory, IT-31:192–204, March 1985.
P.V. Kumar, O. Moreno, Z. Zhang and V.A. Zionviev. New constructions of optimal cylically permutable constant weight codes. to appear in IEEE Trans. on Information Theory, 1993.
R.M. Wilson. Cyclotomy and difference families in elementary abelian groups. J. Number Theory, 4:17–47, 1972.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bitan, S., Etzion, T. (1994). On constructions for optimal optical orthogonal codes. In: Cohen, G., Litsyn, S., Lobstein, A., Zémor, G. (eds) Algebraic Coding. Algebraic Coding 1993. Lecture Notes in Computer Science, vol 781. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57843-9_13
Download citation
DOI: https://doi.org/10.1007/3-540-57843-9_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57843-7
Online ISBN: 978-3-540-48357-1
eBook Packages: Springer Book Archive