Information sets and partial permutation decoding for codes from finite geometries
| Contribuinte(s) |
Algebraic Combinatorics Institute of Mathematics & Physics (ADT) |
|---|---|
| Data(s) |
08/12/2008
08/12/2008
01/04/2006
|
| Resumo |
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 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. Peer reviewed |
| Formato |
16 |
| Identificador |
Key , J D , McDonough , T & 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 . DOI: 10.1016/j.ffa.2005.05.007 1071-5797 PURE: 88931 PURE UUID: fdc1107f-8c0b-4aca-93f7-f469c3a621f8 dspace: 2160/1427 |
| Idioma(s) |
eng |
| Relação |
Finite Fields and Their Applications |
| Tipo |
/dk/atira/pure/researchoutput/researchoutputtypes/contributiontojournal/article |
| Direitos |
