On the weights of trace codes
[For the entire collection see Zbl 0745.00062.] Let \(C\) be a linear code of length \(n\) over the field \(GF(q^ m)\) (where \(q\) is a power of some prime \(p\)) and \(\text{tr}: GF(q^ m)\to GF(q)\) denote the trace map, i.e. \(\text{tr}(\gamma)=\gamma+\gamma^ q+\cdots+\gamma^{q^{m-1}}\) for \(\gamma\in GF(q^ m)\). We define the trace code of \(C\) to be \[ \text{tr}(C)=\bigl\{(\text{tr}(\gamma_ 1),\dots,\text{tr}(\gamma_ n))\in GF(q)^ n\mid(\gamma_ 1,\dots,\gamma_ n)\in C\bigr\}. \] Clearly, \(\text{tr}(C)\) is a linear code of length \(n\) over \(GF(q)\). Many interesting codes over \(GF(q)\) can be represented as trace codes. For example, the dual code of a subfield subcode is always a trace code (Delsarte's theorem). In particular, the duals of BCH codes can be considered as trace codes. By using the Hasse-Weil-Serre bound for the number of rational places of algebraic function fields over \(GF(q^ m)\) we obtain an estimate for the weights of codewords in \(\text{tr}(C)\) for a large class of trace codes.
- On the generalized weights of a class of trace codes
- Weight distribution of trace codes over finite rings
- FEW-WEIGHT CODES FROM TRACE CODES OVER
- Generalized Hamming weights of trace codes
- On the dimension of trace codes
- scientific article; zbMATH DE number 3394010
- Improvements on generalized Hamming weights of some trace codes
- On weights in duadic codes
- Trace description and Hamming weights of irreducible constacyclic codes
- Few-weight codes from trace codes over a local ring
- Trace codes over \(\mathbb {Z}_4,\) and Boolean functions
- Improvements on generalized Hamming weights of some trace codes
- A New Upper Bound for the Dimension of Trace Codes
- scientific article; zbMATH DE number 490791 (Why is no real title available?)
- Generalized Hamming weights of trace codes
- Surfaces and the weight distribution of a family of codes
- FEW-WEIGHT CODES FROM TRACE CODES OVER
- On the dimension of algebraic-geometric trace codes
- Distribution of Trace Values and Two-Weight, Self-orthogonal Codes over GF(p,2)
- The trace codes of several classes of linear codes
- On linear codes with random multiplier vectors and the maximum trace dimension property
- On some decision problems for trace codings
- Any lifting of a trace coding is a word coding
This page was built for publication: On the weights of trace codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4027650)