The Threshold Probability of a Code

IEEE Transactions on Information Theory

Volumn 41, Issue 2, 1995, Pages 469-477

  Zémor, Gilles ^a   Cohen, Gérard D ^a  

^a TELECOM PARISTECH   (France)

Author keywords

binomial code; erasure; intersecting code; Threshold probability; Z channel

Indexed keywords

CHANNEL CAPACITY; CODES (SYMBOLS); COMMUNICATION CHANNELS (INFORMATION THEORY); DECODING; ENCODING (SYMBOLS); ERROR ANALYSIS; ESTIMATION; FUNCTIONS; MATHEMATICAL MODELS; NUMERICAL METHODS; PROBABILITY;

BINOMIAL CODES; CAPACITY NOTION; ERASURES; INTERSECTING CODES; LINEAR CODES; MARGULIS THEOREM; THRESHOLD PROBABILITY; VANISHING ERROR PROBABILITY; Z CHANNELS;

INFORMATION THEORY;

EID: 0029274979     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.370148     Document Type: Article

References (19)

1. N. Alon, J. Bruck, J. Naor, M. Naor, and R. Roth, “Construction of asymptotically good low-rate error-correcting codes through pseudorandom graphs,” IEEE Trans. Inform. Theory, vol. 39, pp. 509–516, 1992.
2. E. Blockh and Y. Zyablov, “On the existance of linear binary cascade codes with optimal error-correcting properties,” Probl. Peredachi Inform., vol. 4, pp. 3–10, 1973.
3. B. Bollobás, Random Graphs. New York: Academic Press, 1985.
4. G. Cohen and A. Lempel, “Linear intersecting codes,” Discrete Math., vol. 56, pp. 35–43, 1985.
5. S. D. Constantin and T. R. N. Rao, “On the theory of buinary asymmetric error-correcting codes,” Inform. Contr., vol. 40, pp. 20–36, 1979.
6. C. Crépeau and M. Santha., “Effective reduction among oblivious transfer protocols,” in Sequences II, R. Capocelli et al., Eds. New York: Springer-Verlag, 1994, pp. 360–367.
7. I. I. Dumer and P. G. Farrell, “Erasure correction performance of linear block codes,” in Algebraic Coding, no. 781 in LNCS. New York: Springer-Verlag, 1994, pp. 316–326.
8. T. Etzion, “New lower bounds for asymmetric and unidirectional codes,” IEEE Trans. Inform. Theory, vol. 37, pp. 1696–1704, 1991.
9. R. G. Gallager, “Low-density parity check codes,” IRE Trans. Inform. Theory, vol. IT-8, pp. 21–28, 1962.
10. S. W. Golomb, “The limiting behavior of the Z-channel,” IEEE Trans. Inform. Theory, vol. IT-26, 1980.
11. T. Helleseth, T. Kløve, and Ø. Ytrehus, “Generalized Hamming weights of linear codes,” IEEE Trans. Inform. Theory, vol. 38, pp. 1133–1140, 1992.
12. L. Huguet, “Coding scheme for a wire-tap channel using regular codes,” Discrete Math., vol. 56, pp. 191–201, 1985.
13. T. Kløve, “Upperbounds on codes correcting asymmetric errors,” IEEE Trans. Inform. Theory, vol. 35, pp. 797–810, 1989.
14. G. Margulis, “Probabilistic characteristics of graphs with large connectivity,” Probl. Peredachi Inform., vol. 10, pp. 101–108, 1974.
15. D. Miklós, “Linear binary codes with intersection properties,” Discrete Appl. Math., vol. 9, pp. 187–196, 1984.
16. L. H. Ozarow and A. D. Wyner, “Wire-tap channel II,” AT&T Bell Lab. Tech. J., vol. 63, pp. 2135–2157, 1984.
17. C. T. Retter, “Intersecting Goppa codes,” IEEE Trans. Inform. Theory, vol. 35, pp. 822–828, 1989.
18. M. A. Tsfasman, “Algebraic-geometric codes and asymptotic problems,” Discrete Appl. Math., vol. 33, pp. 241–256, 1991.
19. V. K. Wei, “Generalized Hamming weights for linear codes,” IEEE Trans. Inform. Theory, vol. 37, pp. 1412–1418, 1991.