somnambulism 发表于 2025-3-25 06:49:35
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes978-3-540-44828-0Series ISSN 0302-9743 Series E-ISSN 1611-3349epicardium 发表于 2025-3-25 11:28:00
0302-9743 Overview: Includes supplementary material: 978-3-540-40111-7978-3-540-44828-0Series ISSN 0302-9743 Series E-ISSN 1611-3349electrolyte 发表于 2025-3-25 15:13:42
http://reply.papertrans.cn/16/1597/159624/159624_23.png圆木可阻碍 发表于 2025-3-25 17:05:27
http://reply.papertrans.cn/16/1597/159624/159624_24.pngANNUL 发表于 2025-3-25 21:59:30
https://doi.org/10.1007/978-3-319-64964-1nd then we focus on linear codes over ruled surfaces. At the end we discuss another approach to getting codes over algebraic surfaces using sections of rank two bundles. The new codes are not linear but do have a group structure.噱头 发表于 2025-3-26 02:53:15
Nikolai Mouraviev,Anastasia KoulouriWe consider dynamical systems generated by iterations of rational functions over finite fields and residue class rings. We present a survey of recent developments and outline several open problem.自传 发表于 2025-3-26 07:43:03
http://reply.papertrans.cn/16/1597/159624/159624_27.pngATRIA 发表于 2025-3-26 09:57:46
http://reply.papertrans.cn/16/1597/159624/159624_28.pngPseudoephedrine 发表于 2025-3-26 16:09:17
https://doi.org/10.1007/978-81-322-2065-7Separating systems have earlier been shown to be useful in designing asynchronous sequential circuits, finite automata and fingerprinting. In this paper we study the problem of constructing (s,1)-separating systems from codes and designs.FIN 发表于 2025-3-26 16:58:02
Energy Security and Green EnergyWe present some explicit constructions of families of constant degree expander graphs. We use them to give constructions of expander codes and determine stronger bounds on their parameters. We also show that some of these codes can be decoded very efficiently using the decoding algorithm recently given by Janwa and Lal.