Optimal 2-D \((n\times m,3,2,1)\)-optical orthogonal codes and related equi-difference conflict avoiding codes
From MaRDI portal
Publication:2420468
DOI10.1007/s10623-018-0549-3zbMath1453.05020arXiv1804.04467OpenAlexW2963991502MaRDI QIDQ2420468
Tao Feng, Li-Dong Wang, Xiao Miao Wang
Publication date: 6 June 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.04467
Applications of design theory to circuits and networks (94C30) Combinatorial aspects of packing and covering (05B40)
Related Items (5)
New bound and constructions for geometric orthogonal codes and geometric 180-rotating orthogonal codes ⋮ Determination of the sizes of optimal geometric orthogonal codes with parameters \((n \times m, k, \lambda, k-1)\) ⋮ Some progress on optimal 2-D \((n\times m,3,2,1) \)-optical orthogonal codes ⋮ The spectrum of semicyclic holey group divisible designs with block size three ⋮ Optimal optical orthogonal signature pattern codes with weight three and cross-correlation constraint one
Cites Work
- New optimal constructions of conflict-avoiding codes of odd length and weight 3
- Two classes of optimal two-dimensional OOCs
- Spreads, arcs, and multiple wavelength codes
- Optical orthogonal codes obtained from conics on finite projective planes
- New results on optimal \((v,4,2,1)\) optical orthogonal codes
- Further results on optimal \((v,4,2,1)\)-OOCs
- Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
- On constructions for optimal two-dimensional optical orthogonal codes
- Conflict-avoiding codes and cyclic triple systems
- Constructions for strictly cyclic 3-designs and applications to optimal OOCs with \(\lambda =2\)
- 2-dimensional optical orthogonal codes from Singer groups
- Further results on \((v,4,1)\)-perfect difference families
- Further progress on difference families with block size 4 or 5
- Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
- 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
- Constructions for optimal optical orthogonal codes
- On optimal \((v,5,2,1)\) optical orthogonal codes
- Maximum two-dimensional \((u\times v, 4, 1, 3)\)-OOCs
- Optimal conflict-avoiding codes of odd length and weight three
- Optimal equi-difference conflict-avoiding codes of odd length and weight three
- Optical orthogonal codes: their bounds and new optimal constructions
- Optimal 2-D $(n\times m,3,2,1)$-optical Orthogonal Codes
- Recursive constructions for optimal (n,4,2)-OOCs
- On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users
- Optical orthogonal codes: design, analysis and applications
- Constructions of protocol sequences for multiple access collision channel without feedback
- Constructions for optimal (υ, 4, 1) optical orthogonal codes
- Combinatorial constructions of optimal optical orthogonal codes with weight 4
- Constructions for optimal constant weight cyclically permutable codes and difference families
- Optical orthogonal codes with unequal auto- and cross-correlation constraints
- Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length n = 2k ± 1 and Weight 3
- Bounds and Constructions of Optimal ($n, 4, 2, 1$) Optical Orthogonal Codes
- Combinatorial Constructions for Optimal Two-Dimensional Optical Orthogonal Codes
- On silver and golden optical orthogonal codes
- Large Families of Asymptotically Optimal Two-Dimensional Optical Orthogonal Codes
- Combinatorial Constructions for Optimal Two-Dimensional Optical Orthogonal Codes With $\lambda=2$
- Optimal Conflict-Avoiding Codes of Even Length and Weight 3
- Two-Dimensional Optical Orthogonal Codes and Semicyclic Group Divisible Designs
- Determination of Sizes of Optimal Three‐Dimensional Optical Orthogonal Codes of Weight Three with the AM‐OPP Restriction
- Optimal Two‐Dimensional Optical Orthogonal Codes with the Best Cross‐Correlation Constraint
This page was built for publication: Optimal 2-D \((n\times m,3,2,1)\)-optical orthogonal codes and related equi-difference conflict avoiding codes
