Bounds and constructions on (v,4,3,2) optical orthogonal codes
From MaRDI portal
Publication:2935199
DOI10.1002/JCD.21362zbMATH Open1305.94115OpenAlexW1801404966MaRDI QIDQ2935199FDOQ2935199
Authors: Lidong Wang, Yanxun Chang 
Publication date: 22 December 2014
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.21362
Recommendations
Cites Work
- On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users
- Optimal Conflict-Avoiding Codes of Even Length and Weight 3
- Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
- Title not available (Why is that?)
- Some combinatorial constructions for optical orthogonal codes
- Cyclic designs with block size 4 and related optimal optical orthogonal codes
- Some progress on \((v,4,1)\) difference families and optical orthogonal codes
- Further progress on difference families with block size 4 or 5
- On optimal \((v,5,2,1)\) optical orthogonal codes
- Optical orthogonal codes: Their bounds and new optimal constructions
- Optimal (4up, 5, 1) optical orthogonal codes
- Optical orthogonal codes: design, analysis and applications
- Constructions for optimal (υ, 4, 1) optical orthogonal codes
- 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
- Optical orthogonal codes with unequal auto- and cross-correlation constraints
- Bounds and Constructions of Optimal ($n, 4, 2, 1$) Optical Orthogonal Codes
- Further results on optimal \((v,4,2,1)\)-OOCs
- Further results on \((v,4,1)\)-perfect 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
- A New Class of Optimal Optical Orthogonal Codes With Weight Five
- Constructions for optimal constant weight cyclically permutable codes and difference families
- Families of Optimal OOCs With $\lambda = 2$
- Further results on optimal optical orthogonal codes with weight 4.
- Perfect difference families, perfect difference matrices, and related combinatorial structures
- Constructions for strictly cyclic 3-designs and applications to optimal OOCs with \(\lambda =2\)
- Geometric constructions of optimal optical orthogonal codes
- Constructions of Optical Orthogonal Codes from Finite Geometry
- Existence of \(Z\)-cyclic 3PTWh\((p)\) for any prime \(p \equiv 1\pmod4\)
Cited In (8)
- Constructions for optimal optical orthogonal codes
- Bound and construction for optimal \(\left ( {n,\left\{ {3,4,5} \right\},\left ( {2,3,1} \right),1,Q} \right)\)-OOCs
- The sizes of optimal \((n,4,\lambda,3)\) optical orthogonal codes
- Recursive constructions for optimal (n,4,2)-OOCs
- Maximum two-dimensional \((u\times v, 4, 1, 3)\)-OOCs
- Title not available (Why is that?)
- New results on optimal \((v,4,2,1)\) optical orthogonal codes
- Optimal \((v, 4, 2, 1)\) optical orthogonal codes with small parameters
This page was built for publication: Bounds and constructions on \((v,4,3,2)\) optical orthogonal codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2935199)
