Abstract
Optical orthogonal signature pattern codes (OOSPCs) were first introduced by Kitayama in [K. Kitayama, Novel spatial spread spectrum based fiber optic CDMA networks for image transmission, IEEE J. Sel. Areas Commun. 12 (4) (1994) 762–772]. They find application in transmitting a two-dimensional image through multicore fiber in the CDMA communication system. For given positive integers m, n, k, λa and λc, let Θ(m,n,k,λa,λc) denote the largest number of codewords among all (m,n,k,λa,λc)-OOSPCs. An (m,n,k,λa,λc)-OOSPC with Θ(m,n,k,λa,λc) codewords is said to be optimal. In this paper, the number of codewords in an optimal (m,n,k,λ,k−1)-OOSPC (i.e., the exact value of Θ(m,n,k,λ,k−1)) is determined for any positive integers m, n, k and λ=k−1,k.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
