A method for computing upper bounds on capacity for a class of time-invariant indecomposable finite state channels is presented. It extends a result for finite-input memoryless channels from [1]. Numerical results are provided for selected channels having memory and constraint (binary) input.
[1] I. Csiszár and J. Körner, Information Theory. Budapest: Akadémiai Kiadó (Publishing House of the Hungarian Academy of Sciences), 1981. Coding theorems
for discrete memoryless systems.
By: Pascal O. Vontobel and Dieter M. Arnold
Published in: RZ3349 in 2001
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .