Apology for Citation Omission in “An Algorithm for Computing Minimal Bidirectional Linear Recurrence Relations” [Oct 09 4695-4700

DOI10.1109/TIT.2010.2050938zbMATH Open1366.94452OpenAlexW1970975633MaRDI QIDQ5281373FDOQ5281373

Authors: Ana Sălăgean 

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2010.2050938

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

This page was built for publication: Apology for Citation Omission in “An Algorithm for Computing Minimal Bidirectional Linear Recurrence Relations” [Oct 09 4695-4700

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281373)