{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:10Z","timestamp":1772283550795,"version":"3.50.1"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/isit.2005.1523334","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T15:51:59Z","timestamp":1160581919000},"page":"259-263","source":"Crossref","is-referenced-by-count":7,"title":["Improved Johnson bounds for optical orthogonal codes with \/spl lambda\/ > 1 and some optimal constructions"],"prefix":"10.1109","author":[{"given":"R.","family":"Omrani","sequence":"first","affiliation":[]},{"given":"O.","family":"Moreno","sequence":"additional","affiliation":[]},{"given":"P.V.","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.20003"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2003.09.004"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00439-0"},{"key":"16","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0012-365X(03)00266-8","article-title":"Optimal (n, 4, 2)-ooc of small orders","volume":"279","author":"chu","year":"2004","journal-title":"Discrete Mathematics"},{"key":"13","volume":"1","author":"beth","year":"2000","journal-title":"Design Theory"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/11423461_30"},{"key":"11","author":"lin","year":"1983","journal-title":"Error Control Coding Fundamentals and Applications"},{"key":"12","first-page":"515","article-title":"Cyclical generation of linear subspaces in finite geometries","author":"rao","year":"1969","journal-title":"Proc Combinatorial Mathematics and its Application"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057714"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/18.30982"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/26.31181"},{"key":"10","author":"agrell","year":"0","journal-title":"Tables of Binary Codes[Online]"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/18.53748"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228342"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/18.370146"},{"key":"4","author":"macwilliams","year":"1977","journal-title":"The Theory of Error Correcting Codes"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/18.887851"},{"key":"8","first-page":"366","article-title":"Optimal optical orthogonal codes with ? > 1","author":"omrani","year":"2004","journal-title":"Proc Int Symp on Information Theory"}],"event":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","location":"Adelaide, Australia","start":{"date-parts":[[2005,9,4]]},"end":{"date-parts":[[2005,9,9]]}},"container-title":["Proceedings. International Symposium on Information Theory, 2005. ISIT 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10215\/32581\/01523334.pdf?arnumber=1523334","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T10:08:23Z","timestamp":1497694103000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523334\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2005.1523334","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}