You are in : Home » Results & submissions » Select UOA » 11 - Computer Science and Informatics » View submission: Loughborough University » Outputs » Detail

Output details

11 - Computer Science and Informatics

Loughborough University

Return to search Previous output Next output

Output 10 of 68 in the submission

Article title

An Algorithm for Computing Minimal Bidirectional Linear Recurrence Relations

Type

D - Journal article

DOI

10.1109/TIT.2009.2027520

Title of journal

IEEE Transactions on Information Theory

Article number

Volume number

Issue number

First page of article

4695

ISSN of journal

0018-9448

Year of publication

2009

URL

Number of additional authors

Additional information

<18> A preliminary version of this work was presented at IEEE International Symposium on Information Theory, Toronto, ISIT 2008.The algorithm presented in this paper has been further developed by Li-Ping Wang, "An algorithm for computing bidirectional minimal polynomials for multisequences", IEEE International Symposium on Information Theory, Seoul, ISIT 2009.

Interdisciplinary

Cross-referral requested

Research group

None

Citation count

Proposed double-weighted

Double-weighted statement

Reserve for a double-weighted output

Non-English

English abstract