{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q735040","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q735040","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q735040","kernelVersion":"v1","immutable":true,"modified":"2026-01-15T04:19:42Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q735040","name":"A generalized Gleason-Pierce-Ward theorem","headline":"A generalized Gleason-Pierce-Ward theorem","description":"scientific article; zbMATH DE number 5614982","url":"https://portal.mardi4nfdi.de/entity/Q735040","datePublished":"2009-10-14","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q297907"},{"@id":"https://portal.mardi4nfdi.de/entity/Q325707"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q115940"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1007/S10623-009-9286-Y","url":"https://doi.org/10.1007/S10623-009-9286-Y"},"sameAs":["https://doi.org/10.1007/S10623-009-9286-Y"],"comment":"The authors generalize the Gleason-Pierce-Ward theorem on linear divisible codes to additive divisible codes. Here, a divisible code is defined as a code whose codewords all have Hamming weights divisible by some integer \\(\\Delta>1\\). An additive code over GF\\((q)\\) of length \\(n\\) is a subset of GF\\((q)^n\\) closed under vector addition, that is a GF\\((p)\\)-linear code of GF\\((q)^n\\) for \\(q=p^ m\\) and prime \\(p\\).  The main result is the following: Suppose that \\(\\mathcal{C}\\) is an additive divisible code over GF\\((q)^n\\) (with \\(q=p^m\\)) of length \\(n\\) and size \\(p^k\\) with \\(k=\\frac{m\\cdot n}{2}\\) and divisor \\(\\Delta>1\\). Then one or more of the following holds: (I) \\(q=2\\) and \\(\\Delta =2\\) (II) \\(q=2\\), \\(\\Delta=4\\) and \\(\\mathcal{C}\\) is self-dual. (III) \\(q=3\\), \\(\\Delta=3\\) and \\(\\mathcal{C}\\) is self-dual. (IV) \\(q=4\\), \\(\\Delta =2\\) and \\(\\mathcal{C}\\) is trace self-dual (see below) and (V) \\(\\Delta=2\\) and \\(\\mathcal{C}\\) is equivalent to the linear code over GF\\((p^m)\\) with generator matrix \\([I_{n/2},I_{n/2}]\\).  An additive code \\(\\mathcal{C}\\) over GF\\((4)\\) is called trace self-dual if \\(\\mathcal{C}=\\mathcal{C}^\\bot\\) where the dual is formed by the trace inner product \\(\\langle(x_1,\\dots, x_n),(y_1,\\dots,y_n)\\rangle=\\sum^n_{i=1}(x_iy^2_i+x^2_iy_i)\\). Two additive codes over GF\\((q)\\) are called equivalent if one can be obtained from the other by rearranging and/or re-scaling (that is applying an additive automorphism of GF\\((q)\\) on the coordinates). The codes described in type (V) are not necessarily linear because re-scaling only keeps GF\\((p)\\)-linearity.","citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q3546566"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2741440"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4544827"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1598788"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4701110"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4119093"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4503431"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2491260"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4503454"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1587773"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5921637"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4435818"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1331144"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1321556"},{"@id":"https://portal.mardi4nfdi.de/entity/Q946872"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4242010"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1142197"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3991411"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4242016"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5937123"},{"@id":"https://portal.mardi4nfdi.de/entity/Q856866"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4254169"}]},"provenance":{"prov:generatedAtTime":"2026-01-15T04:19:42Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}