Extended Norm-Trace Codes with Optimized Correction Capability

We consider a generalization of the codes defined by norm and trace functions on finite fields introduced by Olav Geil. The codes in the new family still satisfy Geil’s duality properties stated for normtrace codes. That is, it is easy to find a minimal set of parity checks guaranteeing correction of a given number of errors, as well as the set of monomials generating the corresponding code. Furthermore, we describe a way to find the minimal set of parity checks and the corresponding generating monomials guaranteeing correction at least of generic errors. This gives codes with even larger dimensions.

• Type: Conference
• Year: 2007
• Where: AAECC
• Authors: Maria Bras-Amorós, Michael E. O'Sullivan
• Keywords: AAECC 2007, Algorithms, Minimal Set, Parity Checks, Satisfy Geil Duality