The complexity of decoders--II: Computational work and decoding time
- 1 January 1971
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 17 (1) , 77-85
- https://doi.org/10.1109/tit.1971.1054578
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- A note on the performance of concatenated codes (Corresp.)IEEE Transactions on Information Theory, 1970
- Complexity of decoders--I: Classes of decoding rulesIEEE Transactions on Information Theory, 1969
- On the Time Required to Perform MultiplicationJournal of the ACM, 1967
- Asymptotic performance and complexity of a coding scheme for memoryless channelsIEEE Transactions on Information Theory, 1967
- A lower bound to the distribution of computation for sequential decodingIEEE Transactions on Information Theory, 1967
- Lower bounds to error probability for coding on discrete memoryless channels. IInformation and Control, 1967
- Sequential Decoding - The Computation Problem*Bell System Technical Journal, 1966
- On the Time Required to Perform AdditionJournal of the ACM, 1965
- Polynomial Codes Over Certain Finite FieldsJournal of the Society for Industrial and Applied Mathematics, 1960
- Complexity in Electronic Switching CircuitsIRE Transactions on Electronic Computers, 1956