Determination of the sizes of optimal geometric orthogonal codes with parameters \((n \times m, k, \lambda, k-1)\)
From MaRDI portal
Publication:6123054
DOI10.1007/s10623-023-01312-7MaRDI QIDQ6123054
Zi Hong Tian, Guohui Hao, Xiaowei Su
Publication date: 4 March 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Cryptography (94A60) Combinatorial codes (94B25) Combinatorial aspects of packing and covering (05B40)
Cites Work
- Unnamed Item
- Determination of the sizes of optimal \((m,n,k,\lambda,k-1)\)-OOSPCs for \(\lambda=k-1, k\)
- Two classes of optimal two-dimensional OOCs
- The sizes of optimal \((n,4,\lambda,3)\) optical orthogonal codes
- Further results on optimal \((v,4,2,1)\)-OOCs
- New enumeration results about the optical orthogonal codes
- Geometric orthogonal codes and geometrical difference packings
- The sizes of maximal \((v,k,k-2,k-1)\) optical orthogonal codes
- Optimal optical orthogonal signature pattern codes with weight three and cross-correlation constraint one
- 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
- Optical orthogonal codes: design, analysis and applications
- Determination of the Exact Value for $\Psi(m,k,k-1)$
- New bound and constructions for geometric orthogonal codes and geometric 180-rotating orthogonal codes
This page was built for publication: Determination of the sizes of optimal geometric orthogonal codes with parameters \((n \times m, k, \lambda, k-1)\)