Combinatorial Constructions for Optimal Two-Dimensional Optical Orthogonal Codes With \lambda=2
From MaRDI portal
Combinatorial Constructions for Optimal Two-Dimensional Optical Orthogonal Codes With $\lambda=2$
Abstract: In this paper, we are concerned about optimal two-dimensional optical orthogonal codes with = 2. Some combinatorial constructions are presented and many infinite families of optimal two-dimensional optical orthogonal codes with weight 4 and = 2 are obtained. Especially, we shall see that in many cases an optimal two-dimensional optical orthogonal code can not achieve the Johnson bound.
Cited in
(12)- Combinatorial constructions of optimal \((m,n,4,2)\) optical orthogonal signature pattern codes
- Optimal three-dimensional optical orthogonal codes of weight three
- New optical orthogonal signature pattern codes with maximum collision parameter 2 and weight 4
- Optimal 2-D \((n\times m,3,2,1)\)-optical orthogonal codes and related equi-difference conflict avoiding codes
- Constructions of strictly m-cyclic and semi-cyclic H(m,n,4,3)
- A new construction of group divisible designs with nonuniform group type
- Resolvable generalized difference matrices: existence and applications
- Optimal Two‐Dimensional Optical Orthogonal Codes with the Best Cross‐Correlation Constraint
- Some progress on optimal 2-D (n m,3,2,1) -optical orthogonal codes
- Optimal two-dimensional multilength optical orthogonal codes via compatible mixed difference packing set systems
- Constructions of dihedral Steiner quadruple systems
- Disjoint difference families and their applications
This page was built for publication: Combinatorial Constructions for Optimal Two-Dimensional Optical Orthogonal Codes With $\lambda=2$
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5272305)
