论文信息 - Computational Work and Decoding Time

Computational Work and Decoding Time

The computational work and the time required to decode with reliability E at code rate R on noisy channels are defined, and hounds on the size of these measures are developed. A number of ad hoc decoding pro- cedures are ranked on the basis of the computational work they require.

John E. Savage

[1] Shmuel Winograd,et al. On the Time Required to Perform Addition , 1965, JACM.

[2] John E. Savage,et al. Progress in Sequential Decoding , 1968 .

[3] John E. Savage,et al. Sequential decoding — the computation problem , 1966 .

[4] I. Reed,et al. Polynomial Codes Over Certain Finite Fields , 1960 .

[5] Shmuel Winograd,et al. On the Time Required to Perform Multiplication , 1967, JACM.

[6] R. Gallager. Information Theory and Reliable Communication , 1968 .

[7] David E. Muller,et al. Complexity in Electronic Switching Circuits , 1956, IRE Trans. Electron. Comput..

[8] Jacob Ziv. Asymptotic performance and complexity of a coding scheme for memoryless channels , 1967, IEEE Trans. Inf. Theory.

[9] John E. Savage. A note on the performance of concatenated codes (Corresp.) , 1970, IEEE Trans. Inf. Theory.

[10] Elwyn R. Berlekamp,et al. Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[11] Elwyn R. Berlekamp,et al. Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. II , 1967, Inf. Control..