Further results on optimal (v,4,2,1)-OOCs
From MaRDI portal
Publication:658057
DOI10.1016/J.DISC.2011.09.025zbMATH Open1233.94032OpenAlexW28353286MaRDI QIDQ658057FDOQ658057
Authors: Xiaomiao Wang, Yanxun Chang 
Publication date: 11 January 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0012365X11004390
Recommendations
- Further results on optimal (\(v,\{ 3,k \} ,1,\{ 1/2,1/2\}\))-OOCs for \(k=4,5\)
- Constructions on optimal \({(v,\{4,5\},1,\{\frac{1}{2},\frac{1}{2}\})}\)-OOCs
- Further results on optimal \((n, \{3, 4, 5\}, \Lambda_a, 1, Q)\)-OOCs
- Recursive constructions for optimal (n,4,2)-OOCs
- Constructions of optimal \((v,\{3,4,5,6\},1,Q)\)-OOCs
- Constructions for optimal \((u\times v,\{3,4\},1,Q)\)-OOSPCs
- Bounds and constructions for \((v,W,2,Q)\)-OOCs
- Optimal \((n,4,2)\)-OOC of small orders.
- Bounds and Constructions for Optimal $(n, \{3, 4, 5\}, \Lambda _a, 1, Q)$ -OOCs
- Some series of optimal multilength OOCs of weight four
Cites Work
- Existence of \((q,6,1)\) difference families with \(q\) a prime power
- Existence of (q,k, 1) difference families withq a prime power andk = 4, 5
- Title not available (Why is that?)
- Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
- Cyclotomy and difference families in elementary Abelian groups
- Cyclic designs with block size 4 and related optimal optical orthogonal codes
- Some progress on \((v,4,1)\) difference families and optical orthogonal codes
- Title not available (Why is that?)
- Further progress on difference families with block size 4 or 5
- Optimal (4up, 5, 1) optical orthogonal codes
- Optimal \((v, 4, 2, 1)\) optical orthogonal codes with small parameters
- Optical orthogonal codes: design, analysis and applications
- Constructions of optimal optical orthogonal codes with weight five
- Combinatorial constructions of optimal optical orthogonal codes with weight 4
- New results on optimal \((v,4,2,1)\) optical orthogonal codes
- Title not available (Why is that?)
- Optical orthogonal codes with unequal auto- and cross-correlation constraints
- Bounds and Constructions of Optimal ($n, 4, 2, 1$) Optical Orthogonal Codes
- On cyclic \(2(k-1)\)-support \((n,k)_{k-1}\) difference families
- Strong difference families, difference covers, and their applications for relative difference families
- Constructions for optimal optical orthogonal codes
- Recursive constructions for optimal (n,4,2)-OOCs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Families of Optimal OOCs With $\lambda = 2$
- Some cyclic BIBDs with block size four
- Combinatorial designs and the theorem of Weil on multiplicative character sums
- Further results on optimal optical orthogonal codes with weight 4.
- Constructions for strictly cyclic 3-designs and applications to optimal OOCs with \(\lambda =2\)
- Geometric constructions of optimal optical orthogonal codes
- ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS
Cited In (21)
- Combinatorial constructions for maximum optical orthogonal signature pattern codes
- Optimal \((n,4,2)\)-OOC of small orders.
- Two classes of optimal two-dimensional OOCs
- Bounds and constructions for \((v,W,2,Q)\)-OOCs
- Bound and construction for optimal \(\left ( {n,\left\{ {3,4,5} \right\},\left ( {2,3,1} \right),1,Q} \right)\)-OOCs
- Constructions of optimal \((v,\{3,4,5,6\},1,Q)\)-OOCs
- Further results on optimal \((n, \{3, 4, 5\}, \Lambda_a, 1, Q)\)-OOCs
- The sizes of optimal \((n,4,\lambda,3)\) optical orthogonal codes
- Further results on balanced \((n, \{3, 4 \}, \Lambda_a, 1)\)-OOCs
- Maximum two-dimensional \((u\times v, 4, 1, 3)\)-OOCs
- Some progress on optimal 2-D \((n\times m,3,2,1) \)-optical orthogonal codes
- Optimal \((v,5,2,1)\) optical orthogonal codes of small \(v\)
- A few more optimal optical orthogonal codes with non-constant auto-correlation function
- Optimal 2-D \((n\times m,3,2,1)\)-optical orthogonal codes and related equi-difference conflict avoiding codes
- The sizes of maximal \((v,k,k-2,k-1)\) optical orthogonal codes
- Bounds and constructions on \((v,4,3,2)\) optical orthogonal codes
- Determination of the sizes of optimal geometric orthogonal codes with parameters \((n \times m, k, \lambda, k-1)\)
- Optimal \((v, 4, 2, 1)\) optical orthogonal codes with small parameters
- Determination of the sizes of optimal \((m,n,k,\lambda,k-1)\)-OOSPCs for \(\lambda=k-1, k\)
- Bounds and constructions for optimal \((n, \{3, 5 \}, \varLambda_a, 1, Q)\)-OOCs
- On optimal \((v,5,2,1)\) optical orthogonal codes
This page was built for publication: Further results on optimal \((v,4,2,1)\)-OOCs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658057)
