{"entities":{"Q5960819":{"pageid":8137621,"ns":120,"title":"Item:Q5960819","lastrevid":25487471,"modified":"2024-03-04T22:50:29Z","type":"item","id":"Q5960819","labels":{"en":{"language":"en","value":"Applied algebra, algebraic algorithms and error-correcting codes. 14th international symposium, AAECC-14, Melbourne, Australia, November 26--30, 2001. Proceedings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1730389"}},"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":"Q5960819$7EBE8468-B10A-4197-975C-3D94FCAAD5EC","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"d81c01e061bde7d63f5d11733de11659a1a59066","datavalue":{"value":{"text":"Applied algebra, algebraic algorithms and error-correcting codes. 14th international symposium, AAECC-14, Melbourne, Australia, November 26--30, 2001. Proceedings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5960819$69311EF8-B07C-493A-BE4C-D585A8E7F048","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"047dbb3ade2b013a71d250d7842ba7321d31322b","datavalue":{"value":"0983.00064","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5960819$441972EA-DB44-44A7-8E40-102E00192740","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"85c07c7737819bff773f78e2590a3bb761fe677b","datavalue":{"value":{"entity-type":"item","numeric-id":162374,"id":"Q162374"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5960819$B2FB6857-0583-4ED8-A0FF-D2274ADBF654","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"6863e602815acb5f8df8b9dde489285ae2aa87d0","datavalue":{"value":{"time":"+2002-04-17T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5960819$5CFDF5FD-56ED-4965-BC6A-8DF2A5A4DB6F","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"72314bd3ef41096d30a2fc016aa30f6770157280","datavalue":{"value":"The articles of this volume will be reviewed individually. The preceding symposium (13th, 1999) has been reviewed (see Zbl 0929.00091).  Indexed articles:  \\textit{Massey, James L.}, The ubiquity of Reed-Muller codes, 1-12 [Zbl 1057.94043]  \\textit{Pless, Vera}, Self-dual codes. Theme and variations, 13-21 [Zbl 1057.94030]  \\textit{Shokrollahi, Amin}, Design of differential space-time codes using group theory, 22-35 [Zbl 1057.94517]  \\textit{Sudan, Madhu}, Ideal error-correcting codes: Unifying algebraic and number-theoretic algorithms, 36-45 [Zbl 1057.94516]  \\textit{Baliga, A.; Chua, J.}, Self-dual codes using image restoration techniques, 46-56 [Zbl 1057.94513]  \\textit{Cadic, E.; Carlach, J. C.; Olocco, G.; Otmani, A.; Tillich, J. P.}, Low complexity tail-biting trellises of self-dual codes of length 24, 32 and 40 over GF(2) and \\({\\mathbb Z}_4\\) of large minimum distance, 57-66 [Zbl 1057.94023]  \\textit{Dey, Bikash Kumar; Rajan, B. Sundar}, \\({\\mathbb F}_{q}\\)-linear cyclic codes over \\({\\mathbb F}_q\\): DFT characterization, 67-76 [Zbl 1057.94025]  \\textit{Berger, Thierry P.; de Maximy, Louis}, Cyclic projective Reed-Muller codes, 77-81 [Zbl 1057.94032]  \\textit{Laihonen, Tero; Ranto, Sanna}, Codes identifying sets of vertices, 82-91 [Zbl 1057.94035]  \\textit{Schaathun, Hans Georg}, Duality and greedy weights of linear codes and projective multisets, 92-101 [Zbl 1057.94031]  \\textit{Betsumiya, Koichi; Harada, Masaaki; Munemasa, Akihiro}, Type II codes over \\({\\mathbb F}_{2^r}\\), 102-111 [Zbl 1057.94022]  \\textit{Gupta, Manish K.; Glynn, David G.; Gulliver, T. Aaron}, On senary simplex codes, 112-121 [Zbl 1057.94028]  \\textit{Gulliver, T. Aaron; Harada, Masaaki}, Optimal double circulant \\({\\mathbb Z}_{4}\\)-codes, 122-128 [Zbl 1057.94027]  \\textit{Guruswami, Venkatesan}, Constructions of codes from number fields, 129-140 [Zbl 1057.94039]  \\textit{Horimoto, Hiroshi; Shiromoto, Keisuke}, On generalized Hamming weights for codes over finite chain rings, 141-150 [Zbl 1057.94029]  \\textit{Kelarev, Andrei; Sokratova, Olga}, Information rates and weights of codes in structural matrix rings, 151-158 [Zbl 1057.94034]  \\textit{Geil, Olav; H\u00f8holdt, Tom}, On hyperbolic codes, 159-171 [Zbl 1057.94038]  \\textit{Sakata, Shojiro}, On fast interpolation method for Guruswami-Sudan list decoding of one-point algebraic-geome\\-try codes, 172-181 [Zbl 1057.94040]  \\textit{Rodr\u00edguez-Pal\u00e1nquex, M. C.; Garc\u00eda-Villalba, L. J.; Luengo-Velasco, I.}, Computing the genus of a class of curves, 182-191 [Zbl 1058.14509]  \\textit{Gutierrez, Jaime; Gomez-Perez, Domingo}, Iterations of multivariate polynomials and discrepancy of pseudorandom numbers, 192-199 [Zbl 1053.11068]  \\textit{Parker, Matthew G.}, Even length binary sequence families with low negaperiodic autocorrelation, 200-209 [Zbl 1057.94510]  \\textit{Parraud, Patrice}, On the non-existence of (almost-)perfect quaternary sequences, 210-218 [Zbl 1057.94012]  \\textit{Peinado, A.; Montoya, F.; Mu\u00f1oz, J.; Yuste, A. J.}, Maximal periods of \\(x^2 +c\\) in \\(\\mathbb {F}_q\\), 219-228 [Zbl 1053.11091]  \\textit{Udaya, P.; Bozta\u015f, S.}, On the aperiodic correlation function of Galois ring \\(m\\)-sequences, 229-238 [Zbl 1057.94013]  \\textit{Wang, Liping}, Euclidean modules and multisequence synthesis, 239-248 [Zbl 1057.94014]  \\textit{Charnes, Chris; R\u00f6tteler, Martin; Beth, Thomas}, On homogeneous bent functions, 249-259 [Zbl 1057.94017]  \\textit{Encheva, Sylvia; Cohen, G\u00e9rard}, Partially identifying codes for copyright protection, 260-267 [Zbl 1057.94033]  \\textit{Shparlinski, Igor E.}, On the generalised hidden number problem and bit security of XTR, 268-277 [Zbl 1057.94019]  \\textit{Ustimenko, Vasyl}, CRYPTIM: Graphs as tools for symmetric encryption, 278-286 [Zbl 1057.94512]  \\textit{\u00c1lvarez, V.; Armario, J. A.; Frau, M. D.; Real, P.}, An algorithm for computing cocyclic matrices developed over some semidirect products, 287-296 [Zbl 1061.20045]  \\textit{Giesbrecht, Mark; Jacobson, Michael jun.; Storjohann, Arne}, Algorithms for large integer matrix problems, 297-307 [Zbl 1056.11078]  \\textit{Honkala, Iiro; Karpovsky, Mark G.; Litsyn, Simon}, On the identification of vertices and edges using cycles, 308-314 [Zbl 1059.94031]  \\textit{Balakirsky, Vladimir B.}, On algebraic soft decision decoding of cyclic binary codes, 315-322 [Zbl 1059.94533]  \\textit{Byrne, Eimear}, Lifting decoding schemes over a Galois ring, 323-332 [Zbl 1059.94034]  \\textit{Kasami, Tadao; Tokushige, Hitoshi; Kaji, Yuichi}, Sufficient conditions on most likely local sub-codewords in recursive maximum likelihood decoding algorithms, 333-342 [Zbl 1059.94535]  \\textit{Kuijper, Margreta; van Dijk, Marten; Hollmann, Henk; Oostveen, Job}, A unifying system-theoretic framework for errors-and-erasures Reed-Solomon decoding, 343-352 [Zbl 1059.94036]  \\textit{Wadayama, Tadashi}, An algorithm for computing rejection probability of MLD with threshold test over BSC, 353-362 [Zbl 1059.94039]  \\textit{Boulier, Fran\u00e7ois; Neut, Sylvain}, Cartan's characters and stairs of characteristic sets, 363-372 [Zbl 1059.58004]  \\textit{Gaudry, P.; Schost, \u00c9.}, On the invariants of the quotients of the Jacobian of a curve of genus 2, 373-386 [Zbl 1063.14039]  \\textit{Guidi, Andrew M.; Grant, Alex J.; Pietrobon, Steven S.}, Algebraic constructions for PSK space-time coded modulation, 387-396 [Zbl 1059.94521]","type":"string"},"datatype":"string"},"type":"statement","id":"Q5960819$30D6789D-BAED-451F-94E1-001074908F34","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5960819$0FB18BC1-8BBD-4650-8035-FB17AF832599","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8dc5d8f03fcaaa9e07fb2b90c65b675a74eb1ab2","datavalue":{"value":"94-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5960819$DE8DB8FB-0910-442E-B5DA-DF20269D03A4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5960819$0025DD0C-9E9B-4D94-9717-8970FB556539","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"72c69c5bbebda18242ef21601db2c47e770ce9cf","datavalue":{"value":"1730389","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5960819$30E0C122-730E-4487-8C4C-CA2FB5335A68","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"888338f2ad30b8cd5766691d977522868788edb6","datavalue":{"value":"Melbourne (Australia)","type":"string"},"datatype":"string"},"type":"statement","id":"Q5960819$6732A6D2-F6A4-4C20-9832-50673D180D86","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1b165f2c80f889e3c73f8a20cfd816794dd15c80","datavalue":{"value":"Symposium","type":"string"},"datatype":"string"},"type":"statement","id":"Q5960819$A06F4B72-E892-4AB3-A304-FDE4C401E868","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q5960819$564AA2EE-0CBA-4E42-89A5-E8E2B19940F8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e9b112f095daedef2ed74ceaed4c6e3170db535a","datavalue":{"value":"AAECC-14","type":"string"},"datatype":"string"},"type":"statement","id":"Q5960819$D7BF5F9E-7E44-4899-9C7D-F6A517115EA3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2c39c2e60650f92de6f5f0e9a8eb26a8a65c5ed0","datavalue":{"value":"Applied algebra","type":"string"},"datatype":"string"},"type":"statement","id":"Q5960819$54A4B731-5F94-4ABC-A01A-5A34B7A40637","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c39b15709b8450b50a24dd2b689468c92737f717","datavalue":{"value":"Algebraic algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q5960819$52033F9C-D471-4739-A8E9-0B328A097613","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"b02b2f475ac6b2464907deede1eafee064246551","datavalue":{"value":"Error-correcting codes","type":"string"},"datatype":"string"},"type":"statement","id":"Q5960819$FECC423A-68B3-4B63-A3A4-4263E4DA29B7","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":"Q5960819$183D155C-88F1-4D92-ADF2-B100BAC9C215","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:5960819","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:5960819"}}}}}