{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T11:14:19Z","timestamp":1649070859280},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,9,29]],"date-time":"2007-09-29T00:00:00Z","timestamp":1191024000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1007\/s11277-007-9389-6","type":"journal-article","created":{"date-parts":[[2007,9,28]],"date-time":"2007-09-28T09:38:24Z","timestamp":1190972304000},"page":"39-49","source":"Crossref","is-referenced-by-count":6,"title":["Coding Schemes for Crisscross Error Patterns"],"prefix":"10.1007","volume":"47","author":[{"given":"Simon","family":"Plass","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerd","family":"Richter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. J.","family":"Han Vinck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,9,29]]},"reference":[{"key":"9389_CR1","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/C-M.1976.218410","volume":"9","author":"L. Levine","year":"1976","unstructured":"Levine L., Meyers W. (1976). Semiconductor memory reliability with error detecting and correcting codes. Computers 9, 43\u201350","journal-title":"Computers"},{"key":"9389_CR2","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1147\/rd.186.0579","volume":"18","author":"A.M. Patel","year":"1974","unstructured":"Patel A.M., Hong S.J. (1974). Optimal rectangular code for high density magnetic tapes. IBM J. Res. Dev. 18, 579\u2013588","journal-title":"IBM J. Res. Dev."},{"issue":"4","key":"9389_CR3","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/0097-3165(78)90015-8","volume":"25","author":"P. Delsarte","year":"1978","unstructured":"Delsarte P. (1978). Bilinear forms over a finite field with applications to coding theory. Journal of combinatorial theory. Series A 25(4): 226\u2013241","journal-title":"Journal of combinatorial theory. Series A"},{"issue":"1","key":"9389_CR4","first-page":"3","volume":"21","author":"Gabidulin","year":"1985","unstructured":"Gabidulin, E.M. (1985). Theory of codes with maximum rank distance. Problemy Peredachi Informatsii 21(1): 3\u201316","journal-title":"Problemy Peredachi Informatsii"},{"issue":"2","key":"9389_CR5","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/18.75248","volume":"37","author":"R.M. Roth","year":"1991","unstructured":"Roth R.M. (1991). Maximum-rank array codes and their application to crisscross error correction. IEEE Transactions Information on Theory 37(2): 328\u2013336","journal-title":"IEEE Transactions Information on Theory"},{"key":"9389_CR6","unstructured":"Loidreau, P. (2005). A Welch-Berlekamp like algorithm for decoding Gabidulin codes. In 4th International Workshop on Coding and Cryptography, Bergen, Swiss, March 2005."},{"key":"9389_CR7","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"IT-15","author":"J.L. Massey","year":"1969","unstructured":"Massey J.L. (1969). Shift-register synthesis and BCH decoding. IEEE Transactions Information on Theory IT-15: 122\u2013127","journal-title":"IEEE Transactions Information on Theory"},{"key":"9389_CR8","unstructured":"Blahut, R. E. (1983). Theory and practice of error control codes. New York: Addison Wesley, Owego, 13827, 1983. ISBN 0-201-10102-5."},{"key":"9389_CR9","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1109\/TIT.1987.1057261","volume":"IT-33","author":"K. Imamura","year":"1987","unstructured":"Imamura K., Yoshida W. (1987). A simple derivation of the Berlekamp\u2013Massey algorithm and some applications. IEEE Transactions Information on Theory IT-33: 146\u2013150","journal-title":"IEEE Transactions Information on Theory"},{"key":"9389_CR10","volume-title":"Algebraic coding theory","author":"E.R. Berlekamp","year":"1968","unstructured":"Berlekamp E.R. (1968). Algebraic coding theory. McGraw Hill, New York"},{"issue":"11","key":"9389_CR11","doi-asserted-by":"crossref","first-page":"1782","DOI":"10.1109\/TCOMM.2005.858683","volume":"53","author":"H. Ferreira","year":"2005","unstructured":"Ferreira H., Han Vinck A.J., Swart Th., de Beer I. (2005). Permutation trellis codes. IEEE Transactions Communication 53(11): 1782\u20131789","journal-title":"IEEE Transactions Communication"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-007-9389-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-007-9389-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-007-9389-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:04:25Z","timestamp":1559394265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-007-9389-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,29]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["9389"],"URL":"https:\/\/doi.org\/10.1007\/s11277-007-9389-6","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,29]]}}}