@inproceedings{c3c4181a3df84da3abe7f4fc625e2e26,
title = "Geometric orthogonal codes better than optical orthogonal codes",
abstract = "The class of geometric orthogonal codes (GOCs) were introduced by Doty and Winslow (2016) for more robust macro-bonding in DNA origami. They observed that GOCs are closely related to optical orthogonal codes (OOCs). It is possible for GOCs to have size greater than OOCs of corresponding parameters due to slightly more relaxed constraints on correlations. However, the existence of GOCs exceeding the size of optimal OOCs of corresponding parameters have never been demonstrated. This paper gives the first infinite family of GOCs of size greater than optimal OOCs.",
author = "Chee, {Yeow Meng} and Kiah, {Han Mao} and San Ling and Hengjia Wei",
note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 2017 IEEE International Symposium on Information Theory, ISIT 2017 ; Conference date: 25-06-2017 Through 30-06-2017",
year = "2017",
month = aug,
day = "9",
doi = "10.1109/ISIT.2017.8006758",
language = "English",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers",
pages = "1396--1400",
booktitle = "2017 IEEE International Symposium on Information Theory, ISIT 2017",
address = "United States",
}