{"entities":{"Q6985757":{"pageid":21417561,"ns":120,"title":"Item:Q6985757","lastrevid":76323066,"modified":"2026-04-23T16:21:24Z","type":"item","id":"Q6985757","labels":{"en":{"language":"en","value":"Low-weight codewords in cyclic codes"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8038258"}},"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":"Q6985757$6F5FEDC9-097F-4577-8AC3-465F60ADC93C","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"35312c808a8401c24baf126f7ea432e406d65408","datavalue":{"value":{"text":"Low-weight codewords in cyclic codes","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6985757$3D7FCCD9-11C9-4D64-ABC2-22993322A618","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"74aab7b7de49a9c1297424d310c3b2263a1843c2","datavalue":{"value":"10.1007/S10623-024-01547-Y","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6985757$0EFC41AC-14E1-4954-85BF-92727D508F87","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"7862d6d7ae47e1bc7e43d88dde0ce54e1ff395b5","datavalue":{"value":{"entity-type":"item","numeric-id":6184937,"id":"Q6184937"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6985757$D94DB254-8C62-4A7D-9E16-7D2DF8364206","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d04e73f3fe8edbeaee553afba3a5ad178703657e","datavalue":{"value":{"entity-type":"item","numeric-id":256577,"id":"Q256577"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6985757$0E3990FF-5992-4704-84EB-8FFE2A57D18C","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":"Q6985757$95E8D7AF-A6F2-4015-AF57-39774939A8F1","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"4b64da13dc72ce934cdd1251103882f41d171d88","datavalue":{"value":{"time":"+2025-05-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":"Q6985757$1B341F5C-941A-4F11-B2A9-5267FEEE4604","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"daf0498bad09cd73b9ec1f1a814397b4f4c18f29","datavalue":{"value":"In this paper, the authors discuss how to compute the number of low-weight codewords in cyclic codes. In the first part, they give a few results relating to counting the number of codewords with weights 2 and 3 in cyclic codes. In the section that consists of the main results, the authors establish a recursive relationship for binary cyclic codes that connects their weight distribution to the number of solutions of associated systems of polynomial equations. In the last section, they presents some applications of the obtained main result.","type":"string"},"datatype":"string"},"type":"statement","id":"Q6985757$CF14BBF3-6E9F-4BA8-B0D0-2C4B0265C4D3","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"8a5c29d16d27de0891b19e81d3505a432919bbc2","datavalue":{"value":{"entity-type":"item","numeric-id":622799,"id":"Q622799"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6985757$DC022EFC-8B1C-4F9A-8B96-3F3988293E3D","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"e51adb5fded8427aba510fd00c59eaf339cb8e95","datavalue":{"value":"94B05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6985757$850AED52-35ED-4E08-9EFF-433BF535E47A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"4ccbe597853b179311d5638b907d4c28c9d67538","datavalue":{"value":"94B15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6985757$C9FC4D6B-904A-4BBA-A0C8-A289FD9C6E4C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"f4c7782f72175e3602c0085cb3bfabe8f23ebb24","datavalue":{"value":"94B99","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6985757$EE93139F-CE94-45BA-A47B-489AF5D6FAF4","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"5eab4e7c07e558187e656b5e4404a0b52af3c5c9","datavalue":{"value":"8038258","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6985757$22AECEC9-0529-472F-B76F-09567497DEDA","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d6de087fc11734323f9030fcc8de2cd6be0a01f4","datavalue":{"value":"cyclic codes","type":"string"},"datatype":"string"},"type":"statement","id":"Q6985757$5AFCE050-FE97-4BC6-85E0-D215952785F3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5d117e9dc4ba994c27a752e56c2ea44a65e3d2f4","datavalue":{"value":"weight distribution","type":"string"},"datatype":"string"},"type":"statement","id":"Q6985757$863FB3E1-5B8D-48C3-85D7-8F1FE6061062","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"b077ae6743404f647d92aa7cdb205cab2f2bd1a5","datavalue":{"value":"binary codes","type":"string"},"datatype":"string"},"type":"statement","id":"Q6985757$D69BD874-D9A0-40DB-8B34-9578CB58C5F6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9d3dbef4ff6380a18a00682e062deec4000ff0ad","datavalue":{"value":"low-weight codewords","type":"string"},"datatype":"string"},"type":"statement","id":"Q6985757$4989E524-E4CB-4205-B44A-4F7467A984E1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ac07c7d6c5cdc2dbc4590f3ecbac0ebb59196bea","datavalue":{"value":"finite fields","type":"string"},"datatype":"string"},"type":"statement","id":"Q6985757$D8389E0B-92C9-4CAD-899D-7E98F34AD1B7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2993206874d852f06a0a9aef51360bcc13e745c5","datavalue":{"value":"diagonal equations","type":"string"},"datatype":"string"},"type":"statement","id":"Q6985757$E0C1D62F-5A30-4B6F-9A59-0792213B485A","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":"Q6985757$9D111D0F-0B1D-42C2-9036-667ABF1C3C9E","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Low-weight codewords in cyclic codes","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Low-weight_codewords_in_cyclic_codes"}}}}}