{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T00:01:22Z","timestamp":1752192082930,"version":"3.41.2"},"reference-count":13,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[1972,9,1]],"date-time":"1972-09-01T00:00:00Z","timestamp":84153600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1972,9,1]],"date-time":"1972-09-01T00:00:00Z","timestamp":84153600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1972,9,1]],"date-time":"1972-09-01T00:00:00Z","timestamp":84153600000},"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":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[1972,9]]},"DOI":"10.1109\/tit.1972.1054862","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T14:27:04Z","timestamp":1083076024000},"page":"692-696","source":"Crossref","is-referenced-by-count":6,"title":["Shortened finite geometry codes (Corresp.)"],"prefix":"10.1109","volume":"18","author":[{"family":"Shu Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Error Correcting Codes","year":"1961","author":"peterson","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(70)90214-7"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1971.1054640"},{"key":"ref13","article-title":"New efficient majority-logic decodable cyclic codes","author":"lin","year":"0","journal-title":"1972 IEEE Int Symp Inform Theory"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054126"},{"key":"ref3","article-title":"Euclidean geometry codes","author":"weldon","year":"1967","journal-title":"Proc Symp Combinatorial Mathematics"},{"journal-title":"A geometric approach to coding theory with application to information retrieval","year":"1967","author":"chow","key":"ref6"},{"journal-title":"Majority decodable codes derived from finite geometries","year":"1967","author":"smith","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054900"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"381","DOI":"10.32917\/hmj\/1206138660","article-title":"The rank of the incidence matrix of points of d-flats in finite geometries","volume":"32","author":"hamada","year":"1968","journal-title":"J Sci Hiroshima Univ"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054128"},{"journal-title":"Geometric configuration and majority logic decodable codes","year":"1964","author":"rudolph","key":"ref1"},{"journal-title":"Analysis and Design of Experiments","year":"1949","author":"mann","key":"ref9"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22665\/01054862.pdf?arnumber=1054862","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T23:16:51Z","timestamp":1752103011000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1054862\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1972,9]]},"references-count":13,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.1972.1054862","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[1972,9]]}}}