{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:28Z","timestamp":1772283568195,"version":"3.50.1"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2014,2,1]],"date-time":"2014-02-01T00:00:00Z","timestamp":1391212800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1109\/tit.2013.2292745","type":"journal-article","created":{"date-parts":[[2014,1,24]],"date-time":"2014-01-24T20:14:39Z","timestamp":1390594479000},"page":"1348-1355","source":"Crossref","is-referenced-by-count":52,"title":["New Constructions of Codebooks Nearly Meeting the Welch Bound With Equality"],"prefix":"10.1109","volume":"60","author":[{"given":"Honggang","family":"Hu","sequence":"first","affiliation":[]},{"given":"Jinsong","family":"Wu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"2197","DOI":"10.1073\/pnas.0437847100","article-title":"Optimally sparse representation in general (nonorthogonal) dictionaries via <formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\ell^{1}$<\/tex><\/formula> minimization","volume":"100","author":"donoho","year":"2003","journal-title":"Proc Nat Acad Sci United States Amer"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2011.06.027"},{"key":"ref12","first-page":"39","article-title":"Cyclic Hadamard difference sets?Constructions and applications","author":"golomb","year":"1999","journal-title":"Proc Sequences Appl Discrete Math Theoretical Comput Sci"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546907"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1561\/2000000006"},{"key":"ref15","volume":"20","author":"lidl","year":"1997","journal-title":"Encyclopedia of Mathematics and its Applications"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.817466"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9323-8_7"},{"key":"ref18","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0094449","author":"pott","year":"1995","journal-title":"Finite Geometry and Character Theory"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1063\/1.1737053"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.914731"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1112\/S0024611597000403","article-title":"<formula formulatype=\"inline\"><tex Notation=\"TeX\">${\\rm Z}_{4}$<\/tex><\/formula> -kerdock codes, orthogonal spreads, and extremal Euclidean line-sets","volume":"75","author":"calderbank","year":"1997","journal-title":"Proc London Math Soc"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF03187604"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1080\/10586458.1996.10504585"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.907343"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.880058"},{"key":"ref2","author":"beth","year":"1999","journal-title":"Design Theory"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0061260","author":"baumert","year":"1971","journal-title":"Cyclic Difference Sets"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-007-9140-z"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S1063-5203(03)00023-X"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0551-0_6"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055219"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2196021"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.846411"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-011-9549-2"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2176531"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6714461\/06675050.pdf?arnumber=6675050","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:31:38Z","timestamp":1642005098000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6675050\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2]]},"references-count":26,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2292745","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2]]}}}