{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:50:51Z","timestamp":1730274651247,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/isit.2005.1523445","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T15:51:59Z","timestamp":1160581919000},"page":"790-794","source":"Crossref","is-referenced-by-count":1,"title":["Improved upper bounds for codes with unequal error protection"],"prefix":"10.1109","author":[{"given":"S.I.","family":"Bross","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Litsyn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056753"},{"key":"ref11","first-page":"25","article-title":"Bounds on volume of linear codes with unequal information-symbol protection","volume":"16","author":"katsman","year":"1980","journal-title":"Probl Peredach Inform"},{"key":"ref12","first-page":"131","article-title":"The Hamming sphere has minimum boundary","volume":"10","author":"katona","year":"1975","journal-title":"Stud Sci Math Hungarica"},{"key":"ref13","first-page":"3","article-title":"Upper-bound estimates for fixed-weight codes","volume":"7","author":"levenshtein","year":"1971","journal-title":"Probl Peredach Inform"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90014-9"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.748991"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1054054"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055688"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.272481"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.811925"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056327"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.2307\/1970980"},{"key":"ref6","article-title":"An algebraic approach to the association schemes of coding theory","author":"delsarte","year":"1973","journal-title":"Philips Res Rep Suppl"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054727"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.133260"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(78)90492-8"},{"key":"ref2","first-page":"40","article-title":"Bounds for codes with unequal protection of two sets of messages","volume":"15","author":"bassalygo","year":"1979","journal-title":"Probl Peredach Inform"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365522"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.556129"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2001.3176"}],"event":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","start":{"date-parts":[[2005,9,4]]},"location":"Adelaide, Australia","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\/01523445.pdf?arnumber=1523445","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T17:20:38Z","timestamp":1489598438000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523445\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/isit.2005.1523445","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}