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

DOI10.1109/TIT.2006.881719MaRDI QIDQ3547965zbMATH OpenOpenAlexFDO

Authors

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2006.881719

Mathematics Subject Classification ID

Cryptography (94A60) Error probability in coding theory (94B70)

Recommendations

• scientific article; zbMATH DE number 493102
• scientific article; zbMATH DE number 1456837
• On the computation of the performance probabilities for block codes with a bounded-distance decoding rule
• On the performance of Reed-Muller codes with respect to random errors and erasures
• scientific article; zbMATH DE number 1188998

Cited in

(11)

• On various nonlinearity measures for Boolean functions
• An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
• On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations
• On the annihilators of Boolean polynomials
• Reed-Muller Codes
• On the spectral immunity of periodic sequences restricted to binary annihilators
• The patching landscape of Elisabeth-4 and the mixed filter permutator paradigm
• Use of simple arithmetic operations to construct efficiently implementable Boolean functions possessing high nonlinearity and good resistance to algebraic attacks
• Decoding error probability of random parity-check matrix ensemble over the erasure channel
• TooLIP: how to find new instances of FiLIP cipher with smaller key size and new filters
• Towards a generalization of the algebraic attack on stream ciphers: a study of the case with only extremal-degree monomials

This page was built for publication: A New Upper Bound on the Block Error Probability After Decoding Over the Erasure Channel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547965)