On FGLM Algorithms with Tate Algebras

Autor: Xavier Caruso, Tristan Vaccon, Thibaut Verron

Publikováno v: ISSAC
International Symposium on Symbolic and Algebraic Computation — ISSAC 2021
International Symposium on Symbolic and Algebraic Computation — ISSAC 2021, Jul 2021, Virtual event, Russia

International audience; Tate introduced in [Ta71] the notion of Tate algebras to serve, in the context of analytic geometry over the-adics, as a counterpart of polynomial algebras in classical algebraic geometry. In [CVV19, CVV20] the formalism of Gr

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::45fc5ed71d8056b44dee760cb2d94fda
https://doi.org/10.1145/3452143.3465521

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

An attempt to reduce the computational complexity in the Ikegami-Kaji algorithm for maximum likelihood decoding

Autor: Yuta, Tsuji, Toshirou, Yoshimizu, Sennosuke, Watanabe, Yoshihide, Watanabe

Publikováno v: 同志社大学理工学研究報告 = The Science and Engineering Review of Doshisha University. 54(2):171-177

最尤復号とは,受信後と同じシンドロームを持つベクトルの中でハミング重みが最小の誤りベクトルを選ぶことによって実行される.したがって,最尤復号は有限体上の整数計画問題として�

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=jairo_______::89b992d89bf152c6f119447301e4a8c8
http://id.nii.ac.jp/1707/00022416/

Guessing Linear Recurrence Relations of Sequence Tuples and P-recursive Sequences with Linear Algebra

Autor: Jérémy Berthomieu, Jean-Charles Faugère

Publikováno v: 41st International Symposium on Symbolic and Algebraic Computation
41st International Symposium on Symbolic and Algebraic Computation, Jul 2016, Waterloo, ON, Canada. pp.95-102, ⟨10.1145/2930889.2930926⟩
ISSAC '16: Proceedings of the 2016 on International Symposium on Symbolic and Algebraic Computation
ISSAC

International audience; Given several $n$-dimensional sequences, we first present an algorithmfor computing the Gröbner basis of their module of linear recurrencerelations.A P-recursive sequence $(u_{\mathbf{i}})_{\mathbf{i}\in\mathbb{N}^n}$satisfie

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::09a15192a5116864a21f393f0ada647b
https://hal.inria.fr/hal-01314266/document

Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences

Autor: Brice Boyer, Jérémy Berthomieu, Jean-Charles Faugère

Publikováno v: 40th International Symposium on Symbolic and Algebraic Computation
40th International Symposium on Symbolic and Algebraic Computation, Jul 2015, Bath, United Kingdom. pp.61--68, ⟨10.1145/2755996.2756673⟩
ISSAC '15: Proceedings of the 2015 on International Symposium on Symbolic and Algebraic Computation
ISSAC
Journal of Symbolic Computation
Journal of Symbolic Computation, Elsevier, 2017, 83 (Supplement C), pp.36-67. ⟨10.1016/j.jsc.2016.11.005⟩
Journal of Symbolic Computation, 2017, 83 (Supplement C), pp.36-67. ⟨10.1016/j.jsc.2016.11.005⟩

International audience; Sakata generalized the Berlekamp -- Massey algorithm to $n$ dimensions in~1988. The Berlekamp -- Massey -- Sakata (BMS)algorithm can be used for finding a Gröbner basis of a $0$-dimensionalideal of relations verified by a tab

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6d5fd8b975eddfe10e0f6983e9d344bf
https://hal.inria.fr/hal-01237861/document