Show simple item record

dc.contributor.author Jennifer D. en_US
dc.contributor.author Thomas P. en_US
dc.contributor.author Vassili C. en_US
dc.date.accessioned 2010-11-22T09:33:33Z
dc.date.available 2010-11-22T09:33:33Z
dc.date.issued 2010-11-28 en_US
dc.identifier http://dx.doi.org/10.1016/j.disc.2009.06.001 en_US
dc.identifier.citation Key , J D , McDonough , T P & Mavron , V C 2010 , ' Reed-Muller codes and permutation decoding ' Discrete Mathematics , pp. 3114-3119 . , 10.1016/j.disc.2009.06.001 en_US
dc.identifier.other PURE: 142367 en_US
dc.identifier.other dspace: 2160/5920 en_US
dc.identifier.uri http://hdl.handle.net/2160/5920
dc.description.abstract We show that the first- and second-order Reed–Muller codes, and , can be used for permutation decoding by finding, within the translation group, (m−1)- and (m+1)-PD-sets for for m≥5,6, respectively, and (m−3)-PD-sets for for m≥8. We extend the results of Seneviratne [P. Seneviratne, Partial permutation decoding for the first-order Reed-Muller codes, Discrete Math., 309 (2009), 1967–1970]. en_US
dc.format.extent 6 en_US
dc.relation.ispartof Discrete Mathematics en_US
dc.title Reed-Muller codes and permutation decoding en_US
dc.contributor.pbl Institute of Mathematics & Physics (ADT) en_US
dc.contributor.pbl Algebraic Combinatorics en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search Cadair


Advanced Search

Browse

Statistics