Algorithms for the Minimal Rational Fraction Representation of Sequences Revisited

DOI10.1109/TIT.2021.3125988zbMath1489.94079OpenAlexW3214340774WikidataQ114846806 ScholiaQ114846806MaRDI QIDQ5030365

Guangwu Xu, Yupeng Jiang, Chengliang Tian, Jun Che

Publication date: 17 February 2022

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

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

zbMATH Keywords

time complexitybinary sequenceglobal Euclidean algorithmminimal rational fraction representation (MRFR)partial Euclidean algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

This page was built for publication: Algorithms for the Minimal Rational Fraction Representation of Sequences Revisited