A5010748871- graph theory and CDMA systems
- Coding theory and cryptography
- Finite Group Theory Research
- DNA and Biological Computing
- Genomic variations and chromosomal abnormalities
- Genome Rearrangement Algorithms
- Graph Labeling and Dimension Problems
Yunnan University
2015-2022
Beijing Jiaotong University
2013-2015
Kitayama proposed a novel code-division multiple-access (CDMA) network for image transmission called spatial CDMA. Optical orthogonal signature pattern codes (OOSPCs) have attracted wide attention as patterns of An (m,n,k,λ)-OOSPC is set m × n (0,1)-matrices with Hamming weight k and maximum correlation value λ. Let Θ (m,n,k,λ) be the largest possible number codewords among all -OOSPCs. In this paper, we concentrate on calculation exact (m,n,3,1) construction an (m,n,3,1)-OOSPC codewords. As...
To support high-speed multiple access network applications, especially image Kitayama rst presented the concept of optical orthogonal signature pattern code (OOSPC). An (<italic>m</italic>, <italic>n</italic>, <italic>k</italic>, λ)-OOSPC is a family (0, 1)-matrices Hamming weight <italic>k</italic> satisfying two correlation properties. Let Θ(<italic>m</italic>, λ) denote largest possible number codewords among all λ)-OOSPCs. with said to be optimal. In this paper, we confirm 4, 1) =...
Abstract We determine a necessary and sufficient condition for the existence of semicyclic holey group divisible designs with block size three type . New recursive constructions on incomplete are introduced to settle this problem completely.
Abstract Let be a finite group and let an integer. A ‐difference matrix (DM) is with entries from , such that for all distinct rows the multiset of differences contains each element exactly once. abelian generalized dihedral . It proved ‐DM exists if only even order not isomorphic to Also nine non‐abelian groups 16, we obtain ‐DMs over five them, three them one them. No this last group, where
Optical orthogonal signature pattern codes (OOSPCs) have attracted wide attention as patterns of spatial optical code division multiple access networks. In this paper, an improved upper bound on the size $(m,n,3,\lambda_a,1)$-OOSPC with $\lambda_a=2,3$ is established. The exact number codewords optimal determined for any positive integers $m,n\equiv2\ ({\rm mod }\ 4)$ and $\lambda_a\in\{2,3\}$.