Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
We consider the transmission of a discrete data sequence via a communication channel that is subject to (additive) noise with a known upper bound on its magnitude but otherwise completely unrestricted behaviour. We provide a general recursive algorithm that can be used at the receiving end to perfectly reconstruct the transmitted sequence (possibly with some delay) when the existing necessary and sufficient conditions for perfect reconstruction hold, or to obtain all valid sequences that are consistent with the received sequence when the perfect reconstruction condition is violated. We also discuss the memory and computational requirements for the proposed algorithm.
International Journal of Systems, Control and Communications – Inderscience Publishers
Published: Jan 1, 2010
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.