{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:04:05Z","timestamp":1730279045480,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1109\/itw.2018.8613312","type":"proceedings-article","created":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T00:39:34Z","timestamp":1547771974000},"page":"1-5","source":"Crossref","is-referenced-by-count":2,"title":["Circular-shift Linear Network Codes with Arbitrary Odd Block Lengths"],"prefix":"10.1109","author":[{"given":"Qifu Tyler","family":"Sun","sequence":"first","affiliation":[]},{"given":"Hanqi","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Zongpeng","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xiaolong","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Keping","family":"Long","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.091710.090721"},{"key":"ref11","article-title":"Cyclic and quasi-cyclic LDPC codes on constrained parity-check matrices and their trapping sets","volume":"58","author":"diao","year":"2012","journal-title":"IEEE Trans Inf Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2827945"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613312"},{"journal-title":"Finite Fields","year":"1997","author":"lidl","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17364-6"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228458"},{"key":"ref17","article-title":"Primes with primitive root 2","author":"sloane","year":"0","journal-title":"The On-Line Encyclopedia of Integer Sequences"},{"key":"ref4","article-title":"Circular-shift linear network coding","author":"tang","year":"2018","journal-title":"IEEE Trans Inform Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2553670"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094930"},{"key":"ref7","article-title":"On coding for non-multicast networks","author":"m\u00e9dard","year":"2003","journal-title":"Annual Allerton Conference"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2010.5592671"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557320"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2613085"}],"event":{"name":"2018 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2018,11,25]]},"location":"Guangzhou","end":{"date-parts":[[2018,11,29]]}},"container-title":["2018 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8598908\/8613300\/08613312.pdf?arnumber=8613312","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T22:22:19Z","timestamp":1643235739000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8613312\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/itw.2018.8613312","relation":{},"subject":[],"published":{"date-parts":[[2018,11]]}}}