%0 Journal Article %1 journals/jsc/BrightKHG21 %A Bright, Curtis %A Kotsireas, Ilias S. %A Heinle, Albert %A Ganesh, Vijay %D 2021 %J J. Symb. Comput. %K dblp %P 153-172 %T Complex Golay pairs up to length 28: A search via computer algebra and programmatic SAT. %U http://dblp.uni-trier.de/db/journals/jsc/jsc102.html#BrightKHG21 %V 102

@article{journals/jsc/BrightKHG21, added-at = {2024-06-27T00:00:00.000+0200}, author = {Bright, Curtis and Kotsireas, Ilias S. and Heinle, Albert and Ganesh, Vijay}, biburl = {https://www.bibsonomy.org/bibtex/2d4e98ac8ebb8d7af33cba6dad2b2dd3a/dblp}, ee = {https://doi.org/10.1016/j.jsc.2019.10.013}, interhash = {49b7f0f3ff080fec401ba15ac41a7ad8}, intrahash = {d4e98ac8ebb8d7af33cba6dad2b2dd3a}, journal = {J. Symb. Comput.}, keywords = {dblp}, pages = {153-172}, timestamp = {2024-07-01T07:07:27.000+0200}, title = {Complex Golay pairs up to length 28: A search via computer algebra and programmatic SAT.}, url = {http://dblp.uni-trier.de/db/journals/jsc/jsc102.html#BrightKHG21}, volume = 102, year = 2021 }