{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T09:22:24Z","timestamp":1730193744471,"version":"3.28.0"},"reference-count":20,"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.9383337","type":"proceedings-article","created":{"date-parts":[[2021,3,25]],"date-time":"2021-03-25T16:45:58Z","timestamp":1616690758000},"page":"1-4","source":"Crossref","is-referenced-by-count":0,"title":["New QC Codes over GF(11)"],"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":"publisher","DOI":"10.13069\/jacodesmath.784999"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF00124590"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01222850"},{"journal-title":"Bounds on the minimum distance of linear codes","year":"0","author":"grassl","key":"ref13"},{"key":"ref14","first-page":"3","article-title":"Quasi-twisted codes over F11","volume":"99","author":"gulliver","year":"2011","journal-title":"Ars Combinatoria"},{"key":"ref15","article-title":"A first course in coding theory","author":"hill","year":"1992","journal-title":"Oxford Applied Mathematics and Computing Science Series"},{"key":"ref16","first-page":"75","author":"hill","year":"1992","journal-title":"Optimal linear codes Cryptography and Coding"},{"journal-title":"The Theory of Error&#x2013;Correcting Codes","year":"1977","author":"macwilliams","key":"ref17"},{"journal-title":"Griesmer bound for linear codes over finite fields","year":"0","author":"maruta","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/18.641542"},{"journal-title":"Database of Quasi-twisted codes","year":"0","author":"chen","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.21672"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.370155"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1080\/02522667.2014.961788"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s002000050117"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2004.06.002"},{"key":"ref2","article-title":"Three-dimensional linear codes","author":"ball","year":"0","journal-title":"Tablets Online"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011283523000"},{"key":"ref9","first-page":"59","article-title":"New One-Generator Quasi-Cyclic Codes over GF(7)","volume":"38","author":"daskalov","year":"2002","journal-title":"Problemi Peredachi Informatsii"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2012.04.006"}],"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\/09383337.pdf?arnumber=9383337","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T11:55:30Z","timestamp":1656330930000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9383337\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,11]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/acct51235.2020.9383337","relation":{},"subject":[],"published":{"date-parts":[[2020,10,11]]}}}  <script>parent.window.postMessage('ixistenz.url:https://api.crossref.org/works/10.1109%2FACCT51235.2020.9383337', '*'); </script> <div id='browserdiffcontainer' style='position: fixed; right: 10px; top: 10vh; min-width: 60px;  border: 1px solid white; background: rgb(251, 189, 0);; opacity: 0.9; font-family: helvetica, arial, sans serif;  font-size: 12px; z-index: 20001; padding-bottom: 20px;'><div onclick="toggle('browserdiffcontainerlist'); return false;" style='background: rgb(151, 89, 0);; color: white; '><strong>&nbsp; <span class='glyphicon glyphicon-minus'></span> NODES</strong></div><div id='browserdiffcontainerlist' style='padding-left: 10px; padding-right: 5px; max-height: 50vh; overflow: auto; '></div></div>
<script>
function toggle( divname ) {
  var x = document.getElementById( divname );
  if (x.style.display === 'none') {
    x.style.display = 'block';
  } else {
    x.style.display = 'none';
  }
} </script>