{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:27:49Z","timestamp":1750307269311,"version":"3.41.0"},"reference-count":3,"publisher":"Association for Computing Machinery (ACM)","issue":"3\/4","license":[{"start":{"date-parts":[[2011,1,28]],"date-time":"2011-01-28T00:00:00Z","timestamp":1296172800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2011,1,28]]},"abstract":"<jats:p>This article is devoted to describing an implementation of Chen's algorithm on FPGA. This algorithm allows the computation of minimum distance of cyclic codes. As an application, we determine the minimum distance of quadratic residue codes of length 223.<\/jats:p>","DOI":"10.1145\/1940475.1940503","type":"journal-article","created":{"date-parts":[[2011,2,8]],"date-time":"2011-02-08T13:21:01Z","timestamp":1297171261000},"page":"140-141","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A FPGA implementation of Chen's algorithm"],"prefix":"10.1145","volume":"44","author":[{"given":"Yannick","family":"Saouter","sequence":"first","affiliation":[{"name":"TELECOM Bretagne, LAB-STICC, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e9rald","family":"Le Mestre","sequence":"additional","affiliation":[{"name":"TELECOM Bretagne, LAB-STICC, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,1,28]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1970.1054452"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.21270"},{"key":"e_1_2_1_3_1","volume-title":"North-Holland","author":"MacWilliams F.","year":"1978","unstructured":"F. MacWilliams and N. Sloane . The Theory of Error-Correcting Codes . North-Holland , 1978 . F. MacWilliams and N. Sloane. The Theory of Error-Correcting Codes. North-Holland, 1978."}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1940475.1940503","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1940475.1940503","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:55Z","timestamp":1750243975000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1940475.1940503"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,28]]},"references-count":3,"journal-issue":{"issue":"3\/4","published-print":{"date-parts":[[2011,1,28]]}},"alternative-id":["10.1145\/1940475.1940503"],"URL":"https:\/\/doi.org\/10.1145\/1940475.1940503","relation":{},"ISSN":["1932-2240"],"issn-type":[{"type":"print","value":"1932-2240"}],"subject":[],"published":{"date-parts":[[2011,1,28]]},"assertion":[{"value":"2011-01-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}