{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:06:38Z","timestamp":1755219998615,"version":"3.43.0"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"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":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437772","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"2500-2504","source":"Crossref","is-referenced-by-count":0,"title":["Finite Hyperplane Codes: Minimum Distance and Majority-Logic Decoding"],"prefix":"10.1109","author":[{"given":"Chao","family":"Chen","sequence":"first","affiliation":[{"name":"Xidian University, State Key Laboratory of ISN, Xi'an, China"}]},{"given":"Haiyang","family":"Liu","sequence":"additional","affiliation":[{"name":"Institute of Microelectronics of Chinese Academy of Sciences, Beijing, China"}]},{"given":"Baoming","family":"Bai","sequence":"additional","affiliation":[{"name":"Xidian University, State Key Laboratory of ISN, Xi'an, China"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LPT.2003.810250"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNS.2012.2185061"},{"key":"ref12","first-page":"766","article-title":"Pseudostep orthogonalization: A new threshold-decoding algorithm","volume":"it 17","author":"duc","year":"1971","journal-title":"IEEE Trans Inform Theory"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1970.1054513"},{"key":"ref14","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198502951.001.0001","author":"hirschfeld","year":"1998","journal-title":"Projective Geometries over Finite Fields"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.959255"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008362706649"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803253"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.840867"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.120710.090624"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.12.080493"},{"journal-title":"Error Control Coding Fundamentals and Applications","year":"2004","author":"lin","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1053994"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TELSKS.2003.1246188"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO, USA","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437772.pdf?arnumber=8437772","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T17:42:26Z","timestamp":1754588546000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437772\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437772","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}