{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T10:57:02Z","timestamp":1649156222852},"reference-count":8,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1985,10,1]],"date-time":"1985-10-01T00:00:00Z","timestamp":496972800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10151,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1985,10]]},"DOI":"10.1016\/0012-365x(85)90018-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:31:50Z","timestamp":1027654310000},"page":"111-116","source":"Crossref","is-referenced-by-count":2,"title":["Finite field transforms and symmetry groups"],"prefix":"10.1016","volume":"56","author":[{"given":"R.M.","family":"Campello de Souza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.G.","family":"Farrell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(85)90018-4_BIB1","doi-asserted-by":"crossref","DOI":"10.1109\/PROC.1975.9791","article-title":"Number-theoretic transforms to implement fast digital convolution","volume":"63","author":"Agarwal","year":"1975","journal-title":"IEEE Proc."},{"issue":"3","key":"10.1016\/0012-365X(85)90018-4_BIB2","doi-asserted-by":"crossref","DOI":"10.1147\/rd.233.0299","article-title":"Transform techniques for error control codes","volume":"23","author":"Blahut","year":"1979","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0012-365X(85)90018-4_BIB3","series-title":"The Fourier Transform and its Applications","author":"Bracewell","year":"1978"},{"key":"10.1016\/0012-365X(85)90018-4_BIB4","series-title":"Modern Algebra with Applications","author":"Gilbert","year":"1976"},{"key":"10.1016\/0012-365X(85)90018-4_BIB5","series-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1977"},{"issue":"114","key":"10.1016\/0012-365X(85)90018-4_BIB6","doi-asserted-by":"crossref","DOI":"10.1090\/S0025-5718-1971-0301966-0","article-title":"The fast Fourier transform in a finite field","volume":"25","author":"Pollard","year":"1974","journal-title":"Math. Comp."},{"key":"10.1016\/0012-365X(85)90018-4_BIB7","article-title":"Discrete convolutions via Mersenne transforms","volume":"21","author":"Rader","year":"1972","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0012-365X(85)90018-4_BIB8","article-title":"The fast decoding of RS codes using Fermat transforms","author":"Reed","year":"1978","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X85900184?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X85900184?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T10:10:27Z","timestamp":1580897427000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X85900184"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,10]]},"references-count":8,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1985,10]]}},"alternative-id":["0012365X85900184"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(85)90018-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1985,10]]}}}