{"entities":{"Q1101412":{"pageid":1112164,"ns":120,"title":"Item:Q1101412","lastrevid":66133563,"modified":"2026-04-12T07:46:17Z","type":"item","id":"Q1101412","labels":{"en":{"language":"en","value":"An exhaustion bound for algebraic-geometric ``modular'' codes"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 4047596"}},"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":"Q1101412$B952F39F-0D32-4F0C-9345-EF7B7AC19D14","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"e6f18be54a0d1551e5be8a3a5ed9537e54722336","datavalue":{"value":{"text":"An exhaustion bound for algebraic-geometric ``modular'' codes","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1101412$CB9957A1-0E5F-4D1D-BE6E-8FE405CA8421","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"b08d126956037cf3b950de70d2207ff672f45355","datavalue":{"value":"0642.94030","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1101412$77F58D87-C2B6-4EE0-85D2-92418B54A0D6","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"b906dd3e69327cfccc6f1c244369ce690e434fa2","datavalue":{"value":{"entity-type":"item","numeric-id":174177,"id":"Q174177"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1101412$DA7B211F-E324-49FF-AAE9-6770621329CB","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"5ae48c61eed19d1e1e1f33f9255d5b329362d064","datavalue":{"value":{"time":"+1987-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":"Q1101412$2BA62A8F-0863-44BE-8BCB-BBDDD8B3552F","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"8874118ee72732c1cc4f50b6c8451aa201e8e2fd","datavalue":{"value":"We contruct a new lower bound for asymptotic parameters of codes arising from modular curves. For \\(q=4\\), 9, 16, 25, it is identical to tn language for regular VLSI layouts. This language is a network calculus able to deal with recursive equations. These recursive equations can be understood as graph grammars. The solution of recursive system of equations can be obtained by the iteration of a homomorphism of the net algebra. In a certain sense, the class of the layouts defined by a system of equations can also be understood as Lindenmayer-Rozenberg-system.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1101412$85E8FA38-3000-4394-AE58-D64E49BB60C8","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"e51adb5fded8427aba510fd00c59eaf339cb8e95","datavalue":{"value":"94B05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1101412$A6344F64-BF84-4B31-B401-9C99B6367743","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"db2b8853a52c7f02af86453b6ee74c018fc3284f","datavalue":{"value":"14H25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1101412$3C7AF205-9EA1-4395-8A69-0B9DD7CC6F32","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"0984120cee6e6f9fac1b401e69f03017e2330d09","datavalue":{"value":"4047596","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1101412$B3FF3C05-06A6-4593-AF5D-08632298EB01","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"252242a4b5cdadca2f00082b5e93fa78da64a14a","datavalue":{"value":"lower bound for asymptotic parameters of codes","type":"string"},"datatype":"string"},"type":"statement","id":"Q1101412$E5AD6DB7-8E8A-408A-852C-51C0654C2D9F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"bbc9dfa6b0d527f8cb13bc7a8929713227b7e731","datavalue":{"value":"modular curves","type":"string"},"datatype":"string"},"type":"statement","id":"Q1101412$94ADC983-0BB8-4539-B874-C47BD4CA307E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1e39514a4ce03f4942dfa2f57a1eaf41ebb5b339","datavalue":{"value":"network calculus","type":"string"},"datatype":"string"},"type":"statement","id":"Q1101412$001A69AA-6FE7-4620-B9AE-1ACDBC6758B5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d916c282bad3fc4de21677159239cd8e48664288","datavalue":{"value":"recursive equations","type":"string"},"datatype":"string"},"type":"statement","id":"Q1101412$B60A5B4B-F461-434D-A68F-C983F1C7DF34","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"10aada1bcebcea30af443e4c20bac92e26c0b2a7","datavalue":{"value":"graph grammars","type":"string"},"datatype":"string"},"type":"statement","id":"Q1101412$3F5AD7B5-4B60-47A1-B213-C110C14E61FE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2ae6d2a8393bf292cb4957911d4a846511763a9c","datavalue":{"value":"Lindenmayer-Rozenberg- system","type":"string"},"datatype":"string"},"type":"statement","id":"Q1101412$DEB1B38F-2672-4CC8-8F42-A005256FCCAE","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"40a58b8db542e20cbd0a75c00cb42289f92ead28","datavalue":{"value":{"entity-type":"item","numeric-id":920924,"id":"Q920924"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1101412$1F358C0A-EB7B-4A6F-8879-D6E3AEB45939","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":"Q1101412$D36C524D-5F6A-4C37-B814-FBF8D66F2392","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"77e599bce6eead50ddc65683346bdd03d456a81b","datavalue":{"value":{"entity-type":"item","numeric-id":3783975,"id":"Q3783975"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"ede74a4b8b87171ee46dcb585e189b7ea3b6c7e2","datavalue":{"value":{"amount":"+0.7968367338180542","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1101412$7294BFBA-D54D-462F-9726-214CDFA0A9BC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"3ce41cd5571087f5fcd9018d11af26227e6eb627","datavalue":{"value":{"entity-type":"item","numeric-id":1094389,"id":"Q1094389"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"518f802f4a5807f753d6c4ac3859cc610afab95d","datavalue":{"value":{"amount":"+0.758774995803833","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1101412$5C1F0C3F-D044-46C9-8755-571E877B8379","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"605eaaa31048e52fac8ba4abf14f2cf8eb3772f3","datavalue":{"value":{"entity-type":"item","numeric-id":5175969,"id":"Q5175969"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d7ef12a439ef993a732a6217a55120827c4681a3","datavalue":{"value":{"amount":"+0.7496465444564819","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1101412$EC91DE6D-80AD-471E-BD83-9995003F9786","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"7deb2b8c116b8cf591c7eb4856ad8b99b93db0b4","datavalue":{"value":{"entity-type":"item","numeric-id":1180622,"id":"Q1180622"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"34f29182f545648f9dcf6ec005c0c46efa15b46d","datavalue":{"value":{"amount":"+0.7490849494934082","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1101412$C2413FE2-332A-4616-8781-69CF1FC8F8B2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"822880ec027d016fc4b1e04306883530268bfc52","datavalue":{"value":{"entity-type":"item","numeric-id":5452816,"id":"Q5452816"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"e0408f9ab0dde8f590b72865c085f1fe5cde69ba","datavalue":{"value":{"amount":"+0.7424691319465637","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1101412$044899CC-C998-4EFB-B679-C30B4E416915","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An exhaustion bound for algebraic-geometric ``modular'' codes","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_exhaustion_bound_for_algebraic-geometric_%60%60modular%27%27_codes"}}}}}