{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T11:57:19Z","timestamp":1648987039381},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2015,12]]},"abstract":"<jats:p> Permutation decoding method developed by MacWilliams and described in [Permutation decoding of systematic codes, Bell Syst. Tech. J. 43 (1964) 485\u2013505] is a decoding technique that uses a subset of the automorphism group of the code called a PD-set. The complexity of the permutation decoding algorithm depends on the size of the PD-set and finding a minimal PD-set for an error correcting code is a hard problem. In this paper we examine binary codes from the complete-multipartite graph [Formula: see text] and find PD-sets for all values of [Formula: see text] and [Formula: see text]. Further we show that these PD-sets are minimal when [Formula: see text] is odd and [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830915500603","type":"journal-article","created":{"date-parts":[[2015,10,19]],"date-time":"2015-10-19T02:33:07Z","timestamp":1445221987000},"page":"1550060","source":"Crossref","is-referenced-by-count":3,"title":["Codes from multipartite graphs and minimal permutation decoding sets"],"prefix":"10.1142","volume":"07","author":[{"given":"P.","family":"Seneviratne","sequence":"first","affiliation":[{"name":"Department of Mathematics, Texas A&amp;M University-Commerce, TX, USA"}]}],"member":"219","published-online":{"date-parts":[[2016,1,4]]},"reference":[{"key":"S1793830915500603BIB001","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056504"},{"key":"S1793830915500603BIB002","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026479210284"},{"key":"S1793830915500603BIB003","first-page":"1345","volume-title":"Handbook of Coding Theory","volume":"1","author":"Huffman W. C.","year":"1998"},{"key":"S1793830915500603BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2003.08.001"},{"key":"S1793830915500603BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2006.06.049"},{"key":"S1793830915500603BIB006","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1964.tb04075.x"},{"key":"S1793830915500603BIB007","volume-title":"The Theory of Error-Correcting Codes","author":"MacWilliams F. J.","year":"1998"},{"key":"S1793830915500603BIB008","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1964.14.1405"},{"key":"S1793830915500603BIB009","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056726"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830915500603","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:34:46Z","timestamp":1565109286000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830915500603"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12]]},"references-count":9,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2016,1,4]]},"published-print":{"date-parts":[[2015,12]]}},"alternative-id":["10.1142\/S1793830915500603"],"URL":"https:\/\/doi.org\/10.1142\/s1793830915500603","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12]]}}}