| dc.contributor.author |
Key, Jennifer D. |
|
| dc.contributor.author |
McDonough, Thomas P. |
|
| dc.contributor.author |
Mavron, Vassili C. |
|
| dc.date.accessioned |
2008-12-08T10:06:11Z |
|
| dc.date.available |
2008-12-08T10:06:11Z |
|
| dc.date.issued |
2006-04 |
|
| dc.identifier.citation |
Key , J D , McDonough , T P & Mavron , V C 2006 , ' Information sets and partial permutation decoding for codes from finite geometries ' Finite Fields and Their Applications , vol 12 , no. 2 , pp. 232-247 . |
en |
| dc.identifier.issn |
1071-5797 |
|
| dc.identifier.other |
PURE: 88931 |
|
| dc.identifier.other |
dspace: 2160/1427 |
|
| dc.identifier.uri |
http://hdl.handle.net/2160/1427 |
|
| dc.description |
Mavron, Vassili; McDonough, T.P.; Key, J.D., (2006) 'Information sets and partial permutation decoding for codes from finite geometries', Finite Fields and their applications 12(2) pp.232-247 RAE2008 |
en |
| dc.description.abstract |
We determine information sets for the generalized Reed–Muller codes and use these to apply partial permutation decoding to codes from finite geometries over prime fields. We also obtain new bases of minimum-weight vectors for the codes of the designs of points and hyperplanes over prime fields. |
en |
| dc.format.extent |
16 |
en |
| dc.language.iso |
eng |
|
| dc.relation.ispartof |
Finite Fields and Their Applications |
en |
| dc.title |
Information sets and partial permutation decoding for codes from finite geometries |
en |
| dc.type |
Text |
en |
| dc.type.publicationtype |
Article (Journal) |
en |
| dc.identifier.doi |
http://dx.doi.org/10.1016/j.ffa.2005.05.007 |
|
| dc.contributor.institution |
Institute of Mathematics & Physics (ADT) |
en |
| dc.contributor.institution |
Algebraic Combinatorics |
en |
| dc.description.status |
Peer reviewed |
en |