A New Upper Bound on the Block Error Probability After Decoding Over the Erasure Channel

@article{Didier2006ANU,
  title={A New Upper Bound on the Block Error Probability After Decoding Over the Erasure Channel},
  author={F. Didier},
  journal={IEEE Transactions on Information Theory},
  year={2006},
  volume={52},
  pages={4496-4503}
}
Motivated by cryptographic applications, we derive a new upper bound on the block error probability after decoding over the erasure channel. The bound works for all linear codes and is in terms of the generalized Hamming weights. It turns out to be quite useful for Reed-Muller codes for which all the generalized Hamming weights are known whereas the full weight distribution is only partially known. For these codes, the error probability is related to the cryptographic notion of algebraic… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 22 CITATIONS

On the Construction of Boolean Functions With Optimal Algebraic Immunity

  • IEEE Transactions on Information Theory
  • 2008
VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Generalized column distances for convolutional codes

  • 2017 IEEE International Symposium on Information Theory (ISIT)
  • 2017
VIEW 1 EXCERPT
CITES BACKGROUND

On various nonlinearity measures for boolean functions

  • Cryptography and Communications
  • 2015
VIEW 1 EXCERPT
CITES BACKGROUND

Reed–Muller Codes Achieve Capacity on Erasure Channels

  • IEEE Transactions on Information Theory
  • 2015
VIEW 2 EXCERPTS
CITES BACKGROUND

Generalized weights and bounds for error probability over erasure channels

  • 2014 Information Theory and Applications Workshop (ITA)
  • 2014
VIEW 1 EXCERPT

Four Measures of Nonlinearity

  • IACR Cryptology ePrint Archive
  • 2013
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 15 REFERENCES

On the construction of balanced boolean functions with a good algebraic immunity

  • Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.
  • 2005
VIEW 2 EXCERPTS

A comparison of known codes, random codes, and the best codes

  • Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)
  • 1998
VIEW 1 EXCERPT