On the Complexity of finding Stopping Distance in Tanner Graphs
K. Murali Krishnan, Priti Shankar
Abstract
Two decision problems related to the computation of stopping sets in Tanner graphs are shown to be NP-complete. NP-hardness of the problem of computing the stopping distance of a Tanner graph follows as a consequence
Create a lesson
Related papers
Heterogeneous Demand-Private Coded Caching: Exact Characterization for Two Users and Two Files
Tati V D N Eswar, Jithin Ravi
Fundamental Limits of Covert queueing under Busy-Period Observations
Anumula Venkata Sai Sree Sahithi, Arti Yardi, Jithin Ravi
On Privacy Mechanism Design Under a Bounded α-Lift Leakage Constraint with χ2-Utility
Amirreza Zamani, Mohammad Amin Zarrabian, Parastoo Sadeghi et al.
Neural Polar Codes for Source Coding
Bashar Huleihel, Ziv Aharoni, Haim H. Permuter
Gaussian BROJA Partial Information Decomposition in Closed Form
Ohad Sheelo, Tal Golan, Ari Pakman
Goal-Oriented Ordered Autoencoding for Successive Refinement in Progressive Communication
Qi Liao, Dario Bega