Geometric orthogonal codes and geometrical difference packings
From MaRDI portal
Publication:2161425
DOI10.1007/s10623-022-01078-4OpenAlexW4286632601WikidataQ114226819 ScholiaQ114226819MaRDI QIDQ2161425
Lulu Cai, Zi Hong Tian, Tao Feng, Xiao Miao Wang, Li-Dong Wang
Publication date: 4 August 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-022-01078-4
generalized perfect difference matrixgeometric orthogonal codegeometrical difference familygeometrical difference packing
Related Items
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)\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Further results on \((v,4,1)\)-perfect difference families
- On a conjecture of Paul Erdoes for perfect systems of difference sets
- Some progress on \((v,4,1)\) difference families and optical orthogonal codes
- $(m\kern -1pt,n\kern -1pt,3\kern -1pt,1)$ Optical Orthogonal Signature Pattern Codes With Maximum Possible Size
- Perfect difference families, perfect difference matrices, and related combinatorial structures
- Bounds on the size of optimal difference triangle sets
- New bounds for the sizes of radar arrays
- Asymptotically Optimal Optical Orthogonal Signature Pattern Codes
- Optical Orthogonal Signature Pattern Codes With Maximum Collision Parameter $2$ and Weight $4$
This page was built for publication: Geometric orthogonal codes and geometrical difference packings