{"entities":{"Q7312757":{"pageid":31290238,"ns":120,"title":"Item:Q7312757","lastrevid":105095650,"modified":"2026-09-16T17:13:20Z","type":"item","id":"Q7312757","labels":{"en":{"language":"en","value":"Majority logic decoding of affine Grassmann codes over nonbinary fields"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8238590"}},"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":"Q7312757$B213F136-F8EE-4D10-89B1-8D4687204B05","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"bef03b84935c21bc0300f22ee0209f175f8e67c9","datavalue":{"value":{"text":"Majority logic decoding of affine Grassmann codes over nonbinary fields","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7312757$8FB05518-9234-4A01-BFDD-D8687B2DA47F","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"4cc391ccff7ff7b5d52e169f5333890047cfb355","datavalue":{"value":"10.1007/S10623-026-01915-W","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7312757$38F4210D-A4EA-49DE-98AA-4BA46EF18498","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"1a8bd999906747ef0634d9f4940658b49223c7d5","datavalue":{"value":{"entity-type":"item","numeric-id":2657134,"id":"Q2657134"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7312757$8311686D-E3FD-4B23-893C-9A5841F836B6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"bc9eaf1feedeb75a1029a1f882d76fd27ac38ecc","datavalue":{"value":{"entity-type":"item","numeric-id":670204,"id":"Q670204"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7312757$10172269-D932-4F65-9C52-54D13FCEC969","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"489a07a33d7d358289a1e26e2d93f708773577d6","datavalue":{"value":{"entity-type":"item","numeric-id":6423855,"id":"Q6423855"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7312757$373F4891-97ED-45D9-8256-E432AF99F88D","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"fb34abbf39f11094509111953e4c62a22b1e3897","datavalue":{"value":{"entity-type":"item","numeric-id":115940,"id":"Q115940"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7312757$82AC722D-A592-45F3-9C21-0C7BE9785BB5","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b14a5b1ecdf834e972b878aea74399218a90203a","datavalue":{"value":{"time":"+2026-08-12T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7312757$9352820A-AFB9-4A22-997D-5F0A0F71D91C","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"fc653e3785fc21e56726501a5419e49ac4cbd036","datavalue":{"value":"Decoding procedures for affine Grassmann codes over nonbinary fields are presented. The dual \\(L^{\\perp}\\) of a \\((n,k)\\)-linear code \\(L<\\mathbb{F}_q^n\\), being \\(q\\) a power of a prime, is a \\((n,n-k)\\)-linear code. An index permutation \\(\\sigma\\in S_n\\) is an automorphism for \\(L\\) if whenever \\(\\mathbf{x}=\\left(x_i\\right)_{i=0}^{n-1}\\) is in \\(L\\) the permuted word \\(\\sigma(\\mathbf{x})=\\left(x_{\\sigma(i)}\\right)_{i=0}^{n-1}\\) is also in \\(L\\). Naturally the collection of autmorphisms \\(\\Aut(L)\\) is a subgroup of the symmetric group \\(S_n\\). A subset \\(U\\subset L^{\\perp}\\) is orthogonal on the \\(i\\)-th coordinate if for each \\(\\mathbf{u}\\in U\\), \\(u_i=1\\), and for \\(\\mathbf{u},\\mathbf{v}\\in U\\), \\(\\mathbf{u}\\not=\\mathbf{v}\\), the only coordinate for which both \\(u_i\\), \\(v_i\\) are non-zero is the \\(i\\)-th coordinate.\\N\\NFor \\(m_0,m_1\\in\\mathbb{Z}^+\\), \\(m_0\\leq m_1\\), let \\(m_a=m_0+m_1\\) and \\(m_p=m_0\\cdot m_1\\). Any word \\(\\mathbf{w}\\in\\mathbb{F}_q^{m_p}\\) is realized as a \\((m_0\\times m_1)\\)-planar array and an array \\(\\mathbf{X}\\) of \\(m_p\\) polynomial variables is realized as well as an array \\(\\left(X_{ij}\\right)_{0\\leq i\\leq m_0-1}^{0\\leq j\\leq m_1-1}\\). Let \\(\\Delta(m_0,m_p)\\) consist of the \\((i\\times i)\\)-minors of \\(\\mathbf{X}\\) for \\(0\\leq i\\leq m_0-1\\). Then \\(\\Delta(m_0,m_p)\\subset\\mathbb{F}_q[\\mathbf{X}]\\). Let \\(\\mathcal{F}(m_0,m_p) = \\langle\\Delta(m_0,m_p)\\rangle\\). The evaluation map is \\(Ev:\\mathbb{F}_q[\\mathbf{X}]\\mapsto\\mathbb{F}_q^{m_p}\\), \\(p(\\mathbf{X})\\mapsto\\left(p(\\mathbf{x})\\right)_{\\mathbf{x}\\in\\mathbb{F}_q^{m_p}}\\), and the corresponding affine Grassmann code is \\(G(m_0,m_p):=Ev(\\mathcal{F}(m_0,m_p))<\\mathbb{F}_q^{m_p}\\), which is a \\(\\left(q^{m_p},\\binom{m_a}{m_0}\\right)\\)-linear code. The authors calculate the minimal distances \\(d_{G(m_0,m_p)}=q^{m_p}\\prod_{i=1}^{m_0}\\left(1-\\frac{1}{q^i}\\right)\\) and \\(d_{G(m_0,m_p)^{\\perp}}\\) with value 3 if \\(q>2\\) and 4 if \\(q=2\\), and they characterize the automorphism group of \\(G(m_0,m_p)\\) as the semidirect product \\(\\mathbb{F}_q^{m_0\\times m_1}\\rtimes_{\\theta}(G/Z)\\) where \\(G= \\mathrm{GL}(\\mathbb{F}_q^{m_0})\\times \\mathrm{GL}(\\mathbb{F}_q^{m_1})\\), \\(Z=\\{(k\\mbox{Id}_{m_0},k\\mbox{Id}_{m_1})|\\ k\\in\\mathbb{F}_q^*\\}\\) and \\(\\theta\\) is the homomorphism \\((A,B)\\,Z\\mapsto\\theta((A,B)\\,Z):\\mathbf{x}\\mapsto A\\mathbf{x}B^{-1}\\).\\N\\NFor \\(r\\leq m_0\\), by selecting a collection \\(\\mathcal{A}\\) consisting of \\(r\\) subsets of \\(\\mathbb{F}_q^*\\), each of cardinality \\(r\\), and \\(r\\)-dimensional linear subspaces \\(U_0<\\mathbb{F}_q^{m_0}\\), \\(U_1<\\mathbb{F}_q^{m_1}\\) the authors construct \\((2^r+1,2^r)\\)-linear codes, seen as linear varieties within \\(\\mathbb{F}_q^{m_0\\times m_1}\\). Through this construction, the authors may select a family \\(F_0\\) of great cardinality \\(c_{m_0m_1}\\) consisting of parity check words for \\(G(m_0,m_p)\\), orthogonal with respect to the first coordinate, and, by applying proper automorphisms, similar families with the same cardinality \\(c_{m_0m_1}\\) orthogonal with respect to any coordinate are obtained. This system allows codeword decoding over \\(G(m_0,m_p)\\) using a majority logic, correcting up to \\(\\left\\lfloor\\frac{c_{m_0m_1}-1}{2}\\right\\rfloor\\) errors. The whole procedure has time complexity \\(O\\left(q^{m_p}c_{m_0m_1}\\right)\\) and it can be reduced to \\(O\\left(q^{m_p}\\right)\\) when \\(m_0\\) is fixed. The authors illustrate the decoding procedure for \\((q,m_0,m_1) = (3,2,2)\\).","type":"string"},"datatype":"string"},"type":"statement","id":"Q7312757$658F8C8F-A83F-404B-8D43-4346027AE3AF","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"2c051c55f89b8148a4dc64dba4569555d5561281","datavalue":{"value":{"entity-type":"item","numeric-id":590981,"id":"Q590981"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7312757$B80B974A-5D68-4C30-AE49-E64852981594","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"5120626c87fbc492ba1414fde6695c15d7ff0d86","datavalue":{"value":"94B27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7312757$5C0FDE30-BAE3-4BD7-B666-BB8F8F7A715E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"4430c94528f7856126af01b3ac6ccc7f8c77602b","datavalue":{"value":"94B35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7312757$18BF9F92-EB98-4CFD-AACB-4A40AA2DE0AB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"332a7ca0fc2503044cbe5299ecaa975484163791","datavalue":{"value":"14G50","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7312757$55E1BC9F-1D20-486B-A672-98BF79C2CE01","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"4463a1868217cd94749eb007fbb38bfca7d9edc5","datavalue":{"value":"8238590","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7312757$F5A5B3F1-21FC-4847-B433-5ADBD0805B41","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":"Q7312757$6CDAC0A0-85A2-4677-91F7-B007547C925E","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"8f17c4875a5c8ebcaac7415e9289f9f20d59dfed","datavalue":{"value":{"entity-type":"item","numeric-id":5281384,"id":"Q5281384"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7312757$891CDCCF-3EDC-4B63-B170-61F902E6537F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"b3b69348afafe23e1081dcc55d155cfe79e89392","datavalue":{"value":{"entity-type":"item","numeric-id":5271914,"id":"Q5271914"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7312757$55D1DD2D-1C0A-4CDD-ACA0-65864B8ABB12","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"89e3837f33a78c7caae177df67f843dc69f610e6","datavalue":{"value":{"entity-type":"item","numeric-id":281302,"id":"Q281302"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7312757$4A1FB88E-30C3-4D58-A2DA-9560E6029828","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"c1f8165ba33dd2e22cfd4b6e4402ffc2544ba4ff","datavalue":{"value":{"entity-type":"item","numeric-id":2031641,"id":"Q2031641"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7312757$A1F59EF5-0F86-4DAA-9594-313D082993CB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"f4da20ec83aa2169055821f1fd137af8b60c2da4","datavalue":{"value":{"entity-type":"item","numeric-id":2811785,"id":"Q2811785"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7312757$4D6458A4-68E2-40CD-97D8-1394E1AFB583","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"e66ddebe4729334c412a4acd68d9b98fb85df55f","datavalue":{"value":{"entity-type":"item","numeric-id":2447749,"id":"Q2447749"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7312757$8F8710A2-25BA-436E-88B8-4AC43A6552B3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"d54907135ff5413bb27294f15143b5bc86d7a143","datavalue":{"value":{"entity-type":"item","numeric-id":5723170,"id":"Q5723170"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7312757$DC849190-4356-4E37-BC4E-F8B77A386E4C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"8f268ffdc24678cc4482761cbf87b339c73899eb","datavalue":{"value":{"entity-type":"item","numeric-id":4146667,"id":"Q4146667"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7312757$691DEFFF-2B51-412A-846D-185BB28E601B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"0c96e41068e591e1029701df879f173dca8fb138","datavalue":{"value":{"entity-type":"item","numeric-id":4336974,"id":"Q4336974"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7312757$CFFBA45D-6F60-4B05-8439-2C971837D973","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"07d76abda6579d007129631ecd548be6035e67e1","datavalue":{"value":{"entity-type":"item","numeric-id":670205,"id":"Q670205"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7312757$BCCFC68E-9DD2-4817-8D09-C031A471C313","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"41b07b1c5236342f7895c388a8f17f1884ceee02","datavalue":{"value":{"entity-type":"item","numeric-id":5030322,"id":"Q5030322"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7312757$35526ADB-F751-4DE4-91F1-D89A6FDB1CF5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"a6c472712ce70fe7615b1142e324dd765fcd9001","datavalue":{"value":{"entity-type":"item","numeric-id":3596012,"id":"Q3596012"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7312757$7790ABF0-6EED-4F7A-B3B6-442BF3442AC2","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Majority logic decoding of affine Grassmann codes over nonbinary fields","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Majority_logic_decoding_of_affine_Grassmann_codes_over_nonbinary_fields"}}}}}