کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4647670 1342366 2013 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Determination of the sizes of optimal (m,n,k,λ,k−1)-OOSPCs for λ=k−1,k
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
Determination of the sizes of optimal (m,n,k,λ,k−1)-OOSPCs for λ=k−1,k
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 313, Issue 12, 28 June 2013, Pages 1327-1337
نویسندگان
, ,