{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T09:22:29Z","timestamp":1730193749875,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,10,11]],"date-time":"2020-10-11T00:00:00Z","timestamp":1602374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,10,11]],"date-time":"2020-10-11T00:00:00Z","timestamp":1602374400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,10,11]],"date-time":"2020-10-11T00:00:00Z","timestamp":1602374400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,10,11]]},"DOI":"10.1109\/acct51235.2020.9383380","type":"proceedings-article","created":{"date-parts":[[2021,3,25]],"date-time":"2021-03-25T20:45:58Z","timestamp":1616705158000},"page":"1-4","source":"Crossref","is-referenced-by-count":0,"title":["Three new large (n, r) arcs in PG(2,31)"],"prefix":"10.1109","author":[{"given":"Rumen","family":"Daskalov","sequence":"first","affiliation":[]},{"given":"Elena","family":"Metodieva","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1147\/rd.45.0532","article-title":"A bound for error-correcting codes","volume":"4","author":"griesmer","year":"1960","journal-title":"IBM J Res Develop"},{"key":"ref11","first-page":"95","article-title":"On the existence and the nonexistence of some (k, r)-arcs in PG(2, 17)","author":"daskalov","year":"2004","journal-title":"Proc of Ninth International Workshop on Algebraic and Combinatorial Coding Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s00022-004-1779-2"},{"key":"ref13","first-page":"121","article-title":"New (k, r)-arcs in P G(2, 17) and the related optimal linear codes","volume":"18","author":"daskalov","year":"2004","journal-title":"Mathematica Balkanica New Series"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.03.028"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1134\/S003294601103001X"},{"key":"ref16","first-page":"7","article-title":"Improved bounds on mr(2, q) q = 19,25, 27","volume":"2013","author":"daskalov","year":"0","journal-title":"Hindawi Publishing Corporation Journal of Discrete Mathematics"},{"key":"ref17","first-page":"79","article-title":"New good (n, r)-arcs in PG(2, 29)","author":"daskalov","year":"2013","journal-title":"Proc of Seventh International Workshop on Optimal Codes and Related Topics"},{"key":"ref18","first-page":"127","article-title":"Five new (n, r)-arcs in PG(2, 29)","author":"daskalov","year":"2014","journal-title":"Proc of Fourteenth International Workshop on Algebraic and Combinatorial Coding Theory"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2017.02.018"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2005.04.002"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/54.3.581"},{"key":"ref6","first-page":"107","article-title":"Mathematical theory of the symmetrical factorial design","volume":"8","author":"bose","year":"1947","journal-title":"Sankyha"},{"key":"ref5","first-page":"439","article-title":"Some topics in finite geometrical structures","author":"barlotti","year":"1965"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.21672"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.2140\/iig.2005.1.133"},{"key":"ref2","article-title":"On sets of points in finite planes","author":"ball","year":"1994","journal-title":"PhD thesis"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2019.01.004"},{"article-title":"Three-dimensional linear codes","year":"0","author":"ball","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2017.02.019"},{"key":"ref22","first-page":"41","article-title":"Optimal linear codes","author":"hill","year":"1992","journal-title":"Cryptography and Coding II"},{"key":"ref21","first-page":"127","article-title":"Bounds on mr(2, 29)","volume":"14","author":"daskalov","year":"2019","journal-title":"Iranian Journal of Mathematical Sciences and Informatics"},{"key":"ref24","first-page":"201","article-title":"The packing problem in statistics, coding theory and finite projective spaces","author":"hirschfeld","year":"2001"},{"journal-title":"Projective Geometries over Finite Fields","year":"1998","author":"hirschfeld","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(65)90080-X"},{"journal-title":"Griesmer bound for linear codes over finite fields","year":"0","author":"maruta","key":"ref25"}],"event":{"name":"2020 Algebraic and Combinatorial Coding Theory (ACCT)","start":{"date-parts":[[2020,10,11]]},"location":"Albena, Bulgaria","end":{"date-parts":[[2020,10,17]]}},"container-title":["2020 Algebraic and Combinatorial Coding Theory (ACCT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9383233\/9383236\/09383380.pdf?arnumber=9383380","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T15:55:30Z","timestamp":1656345330000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9383380\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,11]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/acct51235.2020.9383380","relation":{},"subject":[],"published":{"date-parts":[[2020,10,11]]}}}