Optimal 2-D $(n\times m,3,2,1)$-optical Orthogonal Codes

DOI10.1109/TIT.2012.2214025zbMath1364.94688OpenAlexW2086393086MaRDI QIDQ2989499

Xiao Miao Wang, Tao Feng, Yan Xun Chang

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2012.2214025

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial codes (94B25)

Related Items (7)

Optimal 2-D \((n\times m,3,2,1)\)-optical orthogonal codes and related equi-difference conflict avoiding codes ⋮ 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 ⋮ Semi-cyclic holey group divisible designs with block size three ⋮ Optimal optical orthogonal signature pattern codes with weight three and cross-correlation constraint one ⋮ Semi-cyclic Holey Group Divisible Designs and Applications to Sampling Designs and Optical Orthogonal Codes ⋮ Optimal three-dimensional optical orthogonal codes of weight three

This page was built for publication: Optimal 2-D $(n\times m,3,2,1)$-optical Orthogonal Codes