{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T06:09:14Z","timestamp":1761718154646,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/isit.2010.5513736","type":"proceedings-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T19:57:25Z","timestamp":1282247845000},"page":"1310-1314","source":"Crossref","is-referenced-by-count":1,"title":["Near MDS poset codes and distributions"],"prefix":"10.1109","author":[{"given":"Alexander","family":"Barg","sequence":"first","affiliation":[]},{"given":"Punarbasu","family":"Purk","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1996.0098"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01490206"},{"key":"ref12","first-page":"45","article-title":"Codes for the m-metric","volume":"33","author":"rosenbloom","year":"1997","journal-title":"Problems of Information Transmission"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808968"},{"key":"ref14","first-page":"191","article-title":"Coding theory and uniform distributions, Algebra i Analiz","volume":"13","author":"skriganov","year":"2001","journal-title":"English Translation St Petersburg Math J"},{"key":"ref15","first-page":"926","volume":"23","author":"skriganov","year":"2007","journal-title":"On linear codes with large weights simultaneously for the Rosenbloom-Tsfasman and Hamming metrics J of Complexity"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.133259"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01222850"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF00124590"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.681331"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020834531372"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1520-6610(1996)4:4<275::AID-JCD5>3.0.CO;2-C"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-008-9204-8"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(94)00228-B"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"211","DOI":"10.17323\/1609-4514-2009-9-2-211-243","article-title":"Bounds on ordered codes and orthogonal arrays","volume":"9","author":"barg","year":"2009","journal-title":"Moscow Mathematical Journal"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1999-017-5"}],"event":{"name":"2010 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2010,6,13]]},"location":"Austin, TX, USA","end":{"date-parts":[[2010,6,18]]}},"container-title":["2010 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5508195\/5513230\/05513736.pdf?arnumber=5513736","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T03:39:20Z","timestamp":1559446760000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5513736\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2010.5513736","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}