{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:49:54Z","timestamp":1729644594523,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/itw.2006.1633829","type":"proceedings-article","created":{"date-parts":[[2006,5,25]],"date-time":"2006-05-25T20:26:01Z","timestamp":1148588761000},"page":"278-282","source":"Crossref","is-referenced-by-count":3,"title":["On a new q-ary combinatorial analog of the binary Grey-Rankin bound and codes meeting this bound"],"prefix":"10.1109","author":[{"given":"L.","family":"Bassalygo","sequence":"first","affiliation":[]},{"given":"S.","family":"Dodunekov","sequence":"additional","affiliation":[]},{"given":"T.","family":"Helleseth","sequence":"additional","affiliation":[]},{"given":"V.","family":"Zinoviev","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","first-page":"587","article-title":"On generalized concatenated codes","volume":"16","author":"zinoviev","year":"1975","journal-title":"Colloquia Mathematica Societatis Janos Bolyai"},{"key":"13","first-page":"84","article-title":"Class of maximal equidistant codes","volume":"5","author":"semakov","year":"1969","journal-title":"Problems of Information Transmission"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1964-070-1"},{"journal-title":"The Theory of Error-Correcting Codes","year":"1977","author":"macwilliams","key":"11"},{"key":"12","first-page":"3","article-title":"Equidistant q-ary codes with maximal distance and resolvable balanced incomplete block-designs","volume":"4","author":"semakov","year":"1968","journal-title":"Problems of Information Transmission"},{"key":"3","doi-asserted-by":"crossref","DOI":"10.1201\/9781420049954","author":"colbourn","year":"1996","journal-title":"The CRC Handbook of Combinatorial Designs"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729331"},{"journal-title":"Design Theory","year":"1986","author":"beth","key":"1"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1112\/S0025579300000851"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057721"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261600"},{"key":"5","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1109\/18.749033","article-title":"On the hamming distance between two i.i.d. random n-tuples over a finite field","volume":"45","author":"fu","year":"1999","journal-title":"IEEE Trans Inform Theory"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365564"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1997.2765"},{"key":"8","first-page":"43","article-title":"Bounds for packings of metric spaces and some of their applications","volume":"40","author":"levenshtein","year":"1983","journal-title":"Probl Cybern"}],"event":{"name":"2006 IEEE Information Theory Workshop","location":"Punta del Este, Uruguay"},"container-title":["2006 IEEE Information Theory Workshop"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10885\/34255\/01633829.pdf?arnumber=1633829","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T06:02:16Z","timestamp":1497679336000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1633829\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/itw.2006.1633829","relation":{},"subject":[]}}