论文信息 - Error-Correcting Codes for List Decoding

Error-Correcting Codes for List Decoding

Elias (6) derived upper and lower bounds on the sizes of error-correcting codes for list decoding. The asymptotic values of his lower bounds for linear codes and for nonlinear codes are separated. We derive improved lower bounds for linear and for nonlinear codes. We coqjecture our two bounds are identical. However, we were able to verify this only for small lists.

V. Wei | G. Feng

[1] Sergio Verdú,et al. Explicit construction of optimal constant-weight codes for identification via channels , 1993, IEEE Trans. Inf. Theory.

[2] Peter Elias,et al. Error-correcting codes for list decoding , 1991, IEEE Trans. Inf. Theory.

[3] Rudolf Ahlswede,et al. Identification via channels , 1989, IEEE Trans. Inf. Theory.

[4] Rudolf Ahlswede,et al. Identification in the presence of feedback-A discovery of new capacity formulas , 1989, IEEE Trans. Inf. Theory.

[5] I. Csiszár. Information Theory , 1981 .

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

[7] Peter Elias,et al. List decoding for noisy channels , 1957 .