{"entities":{"Q4773715":{"pageid":6803295,"ns":120,"title":"Item:Q4773715","lastrevid":110109929,"modified":"2026-11-15T10:51:39Z","type":"item","id":"Q4773715","labels":{},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3450216"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4773715$17BE23AF-579C-4DB4-AFC5-1FFC87BFCF78","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"60630a564bf4fa4979d0900fdd46c43427791ecd","datavalue":{"value":"0287.05010","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4773715$01BC84E9-FB78-4EB7-A0D4-E4196DFEB27E","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"6c713a6344d4ad5d5668f0e5df25d67713f297a8","datavalue":{"value":{"entity-type":"item","numeric-id":766399,"id":"Q766399"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4773715$18AF38FC-B3D2-4A57-9F5E-99641D052E3B","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"652ad65ffdd573691be68fbfe67aa0cdf6812549","datavalue":{"value":{"time":"+1971-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q4773715$382EA9C1-15F4-47C2-90E4-C1E6BE277F70","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"519910766344eadfe7de0a5eb563216d9fa686bb","datavalue":{"value":"3450216","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4773715$5E7636A0-06CC-4ED5-8CF7-7D8A9BAAF263","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4773715$C7E42EE3-1B1D-4E52-9E41-B8E75D3BE51F","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"e51adb5fded8427aba510fd00c59eaf339cb8e95","datavalue":{"value":"94B05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4773715$9ADCFA82-962B-4C75-A774-3011ED34C614","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"86c47e3aedde4615dd16421ee43ac00d4048a5ec","datavalue":{"value":"05B30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4773715$BFA81727-872B-41FD-A1A1-90CB80AA029F","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e30b2678ca35ee8cfc3458da67107a5a0e3c76b1","datavalue":{"value":"self-dual codes","type":"string"},"datatype":"string"},"type":"statement","id":"Q4773715$C735CF65-176C-4E55-8F9F-55873A36AECF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"955dfc27ccc6e437f71123924cd1054f05887d71","datavalue":{"value":"weight of code vector","type":"string"},"datatype":"string"},"type":"statement","id":"Q4773715$1CFCFBC6-7AB2-4CA7-B4CF-923ED9D45966","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"baf960f72fa3d4ee48da35431ab9ee919ebe16b7","datavalue":{"value":"weight distribution of code","type":"string"},"datatype":"string"},"type":"statement","id":"Q4773715$222D7FB5-E289-4E5B-A58B-2A8D29378B48","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"346eb192457870144c4fa55353e9eefac3153cd8","datavalue":{"value":"MacWilliams equations","type":"string"},"datatype":"string"},"type":"statement","id":"Q4773715$7295F5E2-E115-41F6-9DDF-1D5D7697D284","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d770b124c4c07666897342310a9026d1a0c81295","datavalue":{"value":"weight enumerators","type":"string"},"datatype":"string"},"type":"statement","id":"Q4773715$33584BB7-D6E1-4CAE-A015-C8948765797E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2939c989940237d2c50130bf307310343d188172","datavalue":{"value":"Gleason polynomials","type":"string"},"datatype":"string"},"type":"statement","id":"Q4773715$E9B72733-DD22-441B-B852-403986A5BD4A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4fa517dec81a1200ef9dbff4dc0da77ac341867f","datavalue":{"value":"Hamming code","type":"string"},"datatype":"string"},"type":"statement","id":"Q4773715$6087C541-7C3B-4AA1-8471-AE9C2EAA3D65","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"08b9d6fe9e54ccea09b7521b2a309be0dca3bb6c","datavalue":{"value":"Golay code","type":"string"},"datatype":"string"},"type":"statement","id":"Q4773715$2B5C4F77-876C-4672-8FEF-8683BE756D0A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1e63379844aaf16f63ba6d8c9eef21552fd35485","datavalue":{"value":"invariant ring","type":"string"},"datatype":"string"},"type":"statement","id":"Q4773715$77E7F33F-AAA0-4B40-A3E1-06DFE540748F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3ab4fcf4d3c7270b83dc91360f672d9f3690973a","datavalue":{"value":"free polynomial ring","type":"string"},"datatype":"string"},"type":"statement","id":"Q4773715$AEC5F13B-A9B0-4238-8189-9BE7098687E4","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"e5edc6664701e0f3395076950b4a50bd86a1d9c9","datavalue":{"value":"Let \\(V\\) be the \\(n\\)-dimensional space of all \\(n\\)-tuples over \\(\\mathrm{GF}(q)\\) where any two vectors are added by component-wise addition in \\(\\mathrm{GF}(q)\\). An \\((n,k)\\) code over \\(\\mathrm{GF}(q)\\) is a \\(k\\)-dimensional subspace of \\(V\\). If \\(A\\) is an \\((n,k)\\) code, then the orthogonal of \\(A\\), denoted by \\(A^\\perp\\) is the \\((n,n-k)\\) code consisting of all vectors in \\(V\\) which are orthogonal to all of \\(A\\) under the usual dot product. When \\(A= A^\\perp\\), \\(A\\) is called self-dual. The weight of a code vector is the number of non-zero components it has. The weight distribution of a code is the number of vectors in it of any given weight. The MacWilliams equations [see \\textit{F. J. MacWilliams}, ``A theorem on the distribution of weights in a systematic code,'' Bell Syst. Techn. J. 42, 79--84 (1963)] and the power moments [see \\textit{V. Pless}, ``Power moment identities or weight distributions in error correcting codes'', Inf. Control 6, 147--152 (1963; Zbl 0149.37905)] relate the weight distribution of \\(A\\) to the weight distribution of \\(A\\). When \\(A\\) is self-dual, this places considerable restraints on the weight distribution of \\(A\\). A very interesting advance in weight enumerators occurred when the author proved that the weight distribution of any self-dual code over \\(\\mathrm{GF}(2)\\) or \\(\\mathrm{GF}(3)\\) is given as a sum of products of certain polynomials commonly referred to as the Gleason polynomials. We regard a polynomial in \\(x\\) and \\(y\\) as representing a weight distribution of an \\((n,n/2)\\) self-dual code \\(C\\) by taking the coefficient of \\(x^{n-i}y^i\\) to be the number of vectors of weight \\(i\\) in the code. It is known that all weights of a self-dual code over \\(\\mathrm{GF}(2)\\) must be even. There are three sets of Gleason polynomials as follows. 1) Over GF(2) the weight distribution of any self-dual code is a sum of products of powers of \\(x^2 + y^2\\) and \\(x^8 +14x^4y^4 +y^8\\). -- The former is the weight distribution of the unique \\((2,1)\\) self-dual code, and the latter is the weight distribution of the Hamming \\((8,4)\\) code. 2) Over \\(\\mathrm{GF}(2)\\) the weight distribution of any doubly even codes is a sum of products of powers of \\(x^8 +14x^4y^4 +y^8\\) and \\(x^{24} +759x^{18}y^8 +2576x^{12}y^{12} +759x^8y^{18} + y^{24}\\). The latter is the weight distribution of the \\((24, 12)\\) Golay code. 3) Over \\(\\mathrm{GF}(3)\\) the weight distribution of any self-dual code is a sum of products of powers of \\(y^4 + 8x^3y\\) and \\(y^3 (x^3 - y^3)^3\\). These polynomials have been used widely for many theoretical coding problems. In addition to their theoretical interest, the Gleason polynomials are very useful in the actual computation of weight distributions. - These results are demonstrated by showing that for each situation above, the weight polynomials form a free ring which is invariant under a certain group. In case 1, this group is \\(D_8\\) with 16 elements, in case 3 the group has 48 elements. In each case this invariant ring is a free polynomial ring generated by its Gleason polynomials. [This article was published in the book announced in Zbl 0219.00001.]","type":"string"},"datatype":"string"},"type":"statement","id":"Q4773715$4424F2A0-8767-44C1-8B52-85A346BBE8F8","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Scientific article; zbMATH DE number 3450216","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Scientific_article;_zbMATH_DE_number_3450216"}}}}}