{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:06:13Z","timestamp":1754161573509,"version":"3.41.2"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1023\/a:1018057506207","type":"journal-article","created":{"date-parts":[[2003,11,3]],"date-time":"2003-11-03T19:30:08Z","timestamp":1067887808000},"page":"187-214","source":"Crossref","is-referenced-by-count":0,"title":["Fast Decoding Algorithms for First Order Reed-Muller and Related Codes"],"prefix":"10.1007","volume":"7","author":[{"given":"Alexey E.","family":"Ashikhmin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon N.","family":"Litsyn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"105392_CR1","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1109\/TIT.1987.1057368","volume":"IT-33","author":"J-P Adoul","year":"1987","unstructured":"J-P Adoul, Fast ML decoding algorithm for the Nordstrom-Robinson code, IEEE Trans. nform. Theory Vol. IT-33 (1987) pp. 931\u2013933.","journal-title":"IEEE Trans. nform. Theory"},{"key":"105392_CR2","unstructured":"A. Ashikhmin. A. Dmitriyov, S. Litsyn and S. Portnoy, Patent USSR, No 1133980 (1988)."},{"issue":"11","key":"105392_CR3","first-page":"30","volume":"31","author":"A. Ashikhmin","year":"1988","unstructured":"A. Ashikhmin and S. Litsyn, Analysis of quasi-optimal decoding algorithms of biorthogonal codes, Radio-electronica Vol31, No. 11 (1988) pp. 30\u201334( in Russian).","journal-title":"Radio-electronica"},{"key":"105392_CR4","unstructured":"A. Ashikhmin and S. Litsyn, Fast decoding algorithms for first order Reed-Muller and related codes, Tel-Aviv University, Reponrt EE93\u20132 (1993)."},{"issue":"3","key":"105392_CR5","first-page":"15","volume":"32","author":".A. Ashikhmin","year":"1990","unstructured":"A. Ashikhmin and S. Litsyn, List algorithm for search of the maximal element of Walsh transform, Radio-electronica Vol 32, No. 3 (1990) pp 15\u201322(In Russian).","journal-title":"Radio-electronica"},{"key":"105392_CR6","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1109\/TIT.1986.1057189","volume":"IT32","author":"Y. Be'ery","year":"1986","unstructured":"Y. Be'ery and J. Snyders, Optimal soft decision block decoders based on fast Hadamard transform, IEEE Trans. Inform. Theory Vol. IT32 (1986) pp. 355\u2013364.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"105392_CR7","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1109\/PROC.1980.11696","volume":"68","author":"E. R. Berlekamp","year":"1980","unstructured":"E. R. Berlekamp, The technology of error-conecting codes, Proc. IEEE, Vol68 (1980) pp.355\u2013364","journal-title":"Proc. IEEE"},{"key":"105392_CR8","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1109\/TIT.1972.1054732","volume":"IT-18","author":"E. Berlekamp","year":"1972","unstructured":"E. Berlekamp and L. R. Welch, Weight distributions of the cosets of the (32,6) Reed-Muller code. IEEE Trans Inform. Theory. Vol. IT-18 (1972) pp.203\u2013207.","journal-title":"IEEE Trans Inform. Theory"},{"key":"105392_CR9","first-page":"272","volume":"IT-28","author":"J. H. Conway","year":"1982","unstructured":"J. H. Conway and N J. A. Sloane, Fast quantizing and decoding algorithms for lattice quantizers and codes, IEEE Trans. Inform. Theory Vol. IT-28 (1982) pp. 272\u2013232.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"105392_CR10","doi-asserted-by":"crossref","unstructured":"J. H. Conway, N.J. A. Sloane, Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice, IEEE Trans. Inform Theory. Vol. [vnIT 32], No. I1 (1986) pp. 41\u201350.","DOI":"10.1109\/TIT.1986.1057135"},{"key":"105392_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2016-7","volume-title":"Sphere Packings, Lattices andGroups","author":"J. H. Conway","year":"1988","unstructured":"J H. Conway and N. J A. Sloane, Sphere Packings, Lattices andGroups Springer-Verlag, New York (1988)."},{"key":"105392_CR12","first-page":"1152","volume":"IT-34","author":"G. D. Fomey Jr","year":"1988","unstructured":"G. D. Fomey,Jr., Coset codes II: Binary lattices and related codes, IEEE Trans Inform. Theory. Vol. IT-34 (1988)pp. 1152\u20131187.","journal-title":"IEEE Trans Inform. Theory"},{"volume-title":"Digital Commumncatons with Space Applicatons","year":"1964","key":"105392_CR13","unstructured":"S.W. Golomb, ed., Digital Commumncatons with Space Applicatons. Prentice-Hall, Englewood CliffS NJ (1964)."},{"key":"105392_CR14","first-page":"247","volume":"37","author":"R. R. Green","year":"1966","unstructured":"R R. Green, A serial orthogonal decoder, JPL Space Programs Summary Vol37 39 IV (1966) pp. 247\u2013253.","journal-title":"JPL Space Programs Summary"},{"key":"105392_CR15","first-page":"909 911","volume":"Com-29","author":"C. M. Hackett","year":"1981","unstructured":"C. M. Hackett, An efficient algorithm for soft decision decoding of the (24,12) extended Golay code, IEEE Trans. Commun., Vol.Com-29 (1981) pp. 909 911, and Vol. Com 30 (1982) p. 554.","journal-title":"IEEE Trans. Commun."},{"issue":"3","key":"105392_CR16","first-page":"189","volume":"14","author":"S. Litsyn","year":"1985","unstructured":"S. Litsyn, G. Mikhailovskaya, E. Nemirovsky and 0. Shekhovtsov, Fast decoding of first order Reed-Mnller indes in the Galssian channel, Prolemr of Control and Information Theory. Vol14. No. 3 (1985) pp. 189\u2013201.","journal-title":"Prolemr of Control and Information Theory"},{"issue":"2","key":"105392_CR17","first-page":"3","volume":"19","author":"S. Litsyn","year":"1983","unstructured":"S. Litsyn and 0. Shekhovtsov, Fast decoding algorithm for first order Reed-Muller codes, Problems of Information Transmission Vol19, No.2 (1983) pp. 3\u20137.","journal-title":"Problems of Information Transmission"},{"issue":"195","key":"105392_CR18","first-page":"403","volume":"57","author":"J. A. Maiorna","year":"1991","unstructured":"J. A. Maiorna, A classification of the sets of the Reed Muller code 72(16) Mathcmatics of Computation Vol57, No. 195 (1991) pp. 403\u2013414.","journal-title":"Mathcmatics of Computation"},{"key":"105392_CR19","volume-title":"The Theory of Errorcorecing Codes","author":"E. J. MacWilliams","year":"1977","unstructured":"E J. MacWilliams and N. J. A. Sloane, The Theory of Errorcorecing Codes North-Holland, Amsterdam, The Netherlands (1977)."},{"key":"105392_CR20","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1109\/TIT.1980.1056211","volume":"IT-26","author":"H. J. Manley","year":"1980","unstructured":"H. J. Manley, H. F. Mattson and J. R. Schatz, Some applications of Good's theorem, IEEE Trans. nform. Theory Vol. IT-26 (1980) pp. 475\u2013476.","journal-title":"IEEE Trans. nform. Theory"},{"key":"105392_CR21","first-page":"561 567.","volume":"IT-32","author":"V. Pless","year":"1986","unstructured":"V. Pless, Decoding the Golay codes, IEEE Trans. Inform. Theory, Vol. IT-32 (1986) pp. 561 567.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"105392_CR22","first-page":"36","volume":"7","author":"N. J. A. Sloane","year":"1971","unstructured":"N. J. A. Sloane and R. J. Dick, On the enumeration of cosets of first order Reed-Muller codes, Proc. IEEE Int Conf Communications Vol. 7 (1971) 36\u20132\u201336\u20136.","journal-title":"Proc. IEEE Int Conf Communications"},{"key":"105392_CR23","first-page":"963","volume":"IT-35","author":"J. Snyders","year":"1986","unstructured":"J. Snyders and Y. Be'ery, Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes, IEEE Trans. Inform. Theory Vol. IT-35 (1986) pp. 963\u2013975.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"105392_CR24","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1109\/TIT.1983.1056726","volume":"IT-29","author":"J. Wolfmann","year":"1983","unstructured":"J. Wolfmann, A permutation decoding of the (24,12,8) Golay code, IEEE Trans. Inform. Theory, Vol.IT-29 (1983) pp. 748\u2013750.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018057506207.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018057506207\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018057506207.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:39:41Z","timestamp":1753760381000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018057506207"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["105392"],"URL":"https:\/\/doi.org\/10.1023\/a:1018057506207","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}