Random coding techniques for nonrandom codes

IEEE Transactions on Information Theory

Volumn 45, Issue 6, 1999, Pages 2101-2104

  Shulman, Nadav ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Bounds on the error probability; Code ensembles; Code's spectrum; Error exponent; Linear codes; Random coding

Indexed keywords

CODES (SYMBOLS); CODING ERRORS; COMMUNICATION CHANNELS (INFORMATION THEORY); DECODING; MAXIMUM LIKELIHOOD ESTIMATION; PROBABILITY; RANDOM PROCESSES; VECTORS;

CHANNEL CODING; LINEAR CODE; RANDOM CODING TECHNIQUE; RANDOM WEIGHT DISTRIBUTION;

ENCODING (SYMBOLS);

EID: 0033184693     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.782147     Document Type: Article

References (18)

1. R. L. Dobrushin, "Asymptotic optimality of group and systematic codes for some channels," Theory Probab. its Applications, pp. 47-60, 1963, translated from Tear. Veroyat. i ee Primen.
2. P. Elias, "Coding for noisy channels," in IRE Conv. Rec., pt. 4, 1955, pp. 37-46.
3. A. Feinstein, "A new basic theorem of information theory," IRE Trans. Inform. Theory, vol. PGIT-4, pp. 2-22, 1954.
4. "Error bound in noisy channels without memory," IRE Trans. Inform. Theory, vol. IT-1, pp. 13-14, 1955.
5. G. L. Katsman, M. A. Tsfasman, and S. G. Vladyt, "Spectra of linear codes and error probability decoding," in Coding Theory and Algebric Geometry (Lecture Notes on Mathematics, vol. 1518), H. Strichenoth and M. A. Tsfasman, Eds. Berlin, Germany: Springer-Verlag, 1992, pp. 82-98.
6. E. M. Gabidulin, "Limits for the decoding error probability when linear codes are used in memoryless channel," Probl. Inform. Transm., pp. 43-18, 1967, translated from Probl. Pered. Inform.
7. R. G. Gallager, "A simple derivation of the coding theorem and some applications," IEEE Trans. Inform. Theory, vol. IT-11, pp. 3-18, 1965.
8. Information Theory and Reliable Communication. New York: Wiley, 1968.
9. Low-Density Parity-Check Codes Cambridge, MA: MIT Press, 1963.
10. D. E. Lazic and V. Senk, "A direct geometrical method for bounding the error exponent for any specific family of channel codes-Part 1: Cutoff rate lower bound for block codes," IEEE Trans. Inform. Theory, vol. 38, pp. 1548-1559, Sept. 1992.
11. G. Poltyrev, "Bounds on the decoding error probability of linear binary codes via their spectra," IEEE Trans. Inform. Theory, vol. 40, pp. 1284-1292, July 1994.
12. G. Sèguin, "Linear ensembles of codes," IEEE Trans. Inform. Theory, vol. IT-25, pp. 477-80, July 1979.
13. C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379-23, July 1948 and pp. 623-656, Oct. 1948.
14. N. Shulman, "Coding theorems for structured code families," M.Sc. thesis, Dep. Elec. Eng.,-Syst., Tel-Aviv Univ., Tel-Aviv, Israel, Sept. 1995.
15. N. Shulman and M. Feder, "Improved error exponent for time-invariant and periodically time-variant convolutional codes," IEEE Trans. Inform. Theory, to be published.
16. A. J. Viterbi, "Convolutional codes and their performance in communication systems," IEEE Trans. Commun. Technol., vol. COM-19, pp. 751-772, Oct. 1971.
17. A. J. Viterbi and J. K. Omura, Principles of Digital Communication and Coding. New York: McGraw-Hill, 1979.
18. J. Wolfowitz, "The coding of message subject to chance errors," Illinois J. Math, vol. 1, pp. 591-606, 1957.