{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:12Z","timestamp":1772283672258,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des Codes Crypt"],"published-print":{"date-parts":[[2005,1]]},"DOI":"10.1007\/s10623-003-4196-x","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T18:12:29Z","timestamp":1108750349000},"page":"89-116","source":"Crossref","is-referenced-by-count":16,"title":["Fq-linear Cyclic Codes over $$F{_q^m}$$ : DFT Approach"],"prefix":"10.1007","volume":"34","author":[{"given":"Bikash Kumar","family":"Dey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B. Sundar","family":"Rajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"J. Bierbrauer, Direct constructions of additive codes, downloadable manuscript from http:\/\/www.math.mtu.edu\/jbierbra\/."},{"key":"CR2","volume-title":"Theory and Practice of Error Control Codes","author":"R. E. Blahut","year":"1983"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/18.75249","volume":"37","author":"G. Castagnoli","year":"1991","journal-title":"IEEE Trans. Inform. Theory"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1109\/TC.1986.1676807","volume":"35","author":"C. L. Chen","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"CR5","unstructured":"C. L. Chen and L. E. Grosbach, Fault-tolerant memory design in the IBM application system\/400, digest of papers, The 21-st International Symposium on Fault-Tolerant Computing (1991) pp. 393?400."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1147\/rd.282.0124","volume":"2","author":"C. L. Chen","year":"1984","journal-title":"IBM J.Rs. Develop."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1109\/TC.1986.1676807","volume":"35","author":"C. L. Chen","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1109\/12.537124","volume":"45","author":"C. L. Chen","year":"1996","journal-title":"IEEE Trans. Comput."},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"J. Conan and G. Seguin, Structural properties and enumeration of quasi cyclic codes, Applicable Algebra Eng. Commun. Comput., No. 4 (1993) pp. 25?39.","DOI":"10.1007\/BF01270398"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1002\/(SICI)1520-6610(1997)5:5<377::AID-JCD6>3.0.CO;2-C","volume":"5","author":"Y. Edel","year":"1997","journal-title":"J. Combinatorial Designs"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"1241","DOI":"10.1109\/18.133243","volume":"37","author":"G. D. Forney Jr.","year":"1991","journal-title":"IEEE Trans. Inform Theory"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"1797","DOI":"10.1109\/18.165454","volume":"38","author":"G. D. Forney Jr.","year":"1992","journal-title":"IEEE Trans. Inform. Theory"},{"key":"CR13","volume-title":"Two Sides of One Tapestry","author":"G. Gunther","year":"1994"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"1861","DOI":"10.1109\/18.705564","volume":"44","author":"M. Hattori","year":"1998","journal-title":"IEEE Trans. Inform. Theory"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/18.212265","volume":"39","author":"M. Isaksson","year":"1993","journal-title":"IEEE Trans. Inform. Theory"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1109\/18.382025","volume":"41","author":"J. M. Jensen","year":"1995","journal-title":"IEEE Trans. Inform. Theory"},{"key":"CR17","volume-title":"Finite Fields, Encyclopedia of Mathematics and Its Applications, Vol. 20","author":"R. Lidl","year":"1987"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"2751","DOI":"10.1109\/18.959257","volume":"47","author":"S. Ling","year":"2001","journal-title":"IEEE Trans. Inform. Theory"},{"key":"CR19","unstructured":"F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland (1988)."},{"key":"CR20","doi-asserted-by":"crossref","unstructured":"P. Mathys, Frequency Domain Description of Repeated-Root Cyclic Codes, In Proceedings of 1994 International Symposium on Information Theory, Trondheim, Norway (1994) p. 47.","DOI":"10.1109\/ISIT.1994.394924"},{"key":"CR21","volume-title":"Finite Rings with Identity","author":"B. R. McDonald","year":"1974"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"1250","DOI":"10.1109\/18.508851","volume":"42","author":"M. Ran","year":"1996","journal-title":"IEEE Trans. Inform. Theory"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1137\/0209059","volume":"9","author":"G. Seroussi","year":"1980","journal-title":"SIAM J. Comput."},{"issue":"5","key":"CR24","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF01225641","volume":"5","author":"B. S. Rajan","year":"1994","journal-title":"Applicable Algebra Eng. Commun. Comput."},{"key":"CR25","doi-asserted-by":"crossref","unstructured":"B. S. Rajan and M. U. Siddiqi, A generalized DFT for abelian codes over Zm,IEEE Trans. Inform. Theory, IT-40 (1994) pp. 2082?2090.","DOI":"10.1109\/18.340486"},{"key":"CR26","doi-asserted-by":"crossref","first-page":"1817","DOI":"10.1109\/18.165458","volume":"38","author":"B. S. Rajan","year":"1992","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"CR27","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1080\/00207219308907181","volume":"75","author":"B. S. Rajan","year":"1993","journal-title":"Int. J. Electronics"},{"key":"CR28","first-page":"752","volume":"34","author":"R. M. Tanner","year":"1998","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"CR29","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1109\/TIT.1967.1053974","volume":"13","author":"R. L. Townsend","year":"1967","journal-title":"IEEE Trans. Inform. Theory"},{"key":"CR30","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1109\/18.75250","volume":"37","author":"J. H. Lint Van","year":"1991","journal-title":"EEE Trans. Inform. Theory"},{"key":"CR31","doi-asserted-by":"crossref","first-page":"2052","DOI":"10.1109\/18.476335","volume":"41","author":"A. A. Zain","year":"1995","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-003-4196-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-003-4196-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-003-4196-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:50:03Z","timestamp":1559245803000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-003-4196-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,1]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,1]]}},"alternative-id":["4196"],"URL":"https:\/\/doi.org\/10.1007\/s10623-003-4196-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,1]]}}}