Add to ORKGThe fact that the general decoding problem for linear codes and the general problem of finding the weights of a linear code are both NP-complete is shown. This strongly suggests, but does not rigorously imply, that no algorithm for either of these problems which runs in polynomial time exists
We examine new approaches to the problem of decoding general linear codes under the strategies of fu...
The problem of exact maximum-likelihood (ML) decoding of general linear codes is well-known to be NP...
Linear programming decoding for low-density parity check codes (and related domains such as compress...
The fact that the general decoding problem for linear codes and the general problem of finding the w...
The problem of maximum-likelihood decoding of linear block codes is known to be hard. The fact that ...
A central paradox of coding theory has been noted for many years, and concerns the existence and con...
Information set decoding is an algorithm for decoding any linear code. Expressions for the complexit...
We study the average-case hardness of the class NP against deterministic polynomial time algorithms....
We study the average-case hardness of the class NP against deterministic polynomial time algorithms....
AbstractIt is proved that there exist encoding schemes which are arbitrarily as efficient as the bin...
Abstract — We outline a procedure for using pseudorandom generators to construct binary codes with g...
AbstractSince the pioneering work of Cook and Karp, an extensive effort has been made in identifying...
AbstractWe study the average-case hardness of the class NP against algorithms in P. We prove that th...
Linear programming (LP) decoding for low-density parity-check codes (and related domains such as com...
AbstractWe prove the following about the Nearest Lattice Vector Problem (in anylpnorm), the Nearest ...
We examine new approaches to the problem of decoding general linear codes under the strategies of fu...
The problem of exact maximum-likelihood (ML) decoding of general linear codes is well-known to be NP...
Linear programming decoding for low-density parity check codes (and related domains such as compress...
The fact that the general decoding problem for linear codes and the general problem of finding the w...
The problem of maximum-likelihood decoding of linear block codes is known to be hard. The fact that ...
A central paradox of coding theory has been noted for many years, and concerns the existence and con...
Information set decoding is an algorithm for decoding any linear code. Expressions for the complexit...
We study the average-case hardness of the class NP against deterministic polynomial time algorithms....
We study the average-case hardness of the class NP against deterministic polynomial time algorithms....
AbstractIt is proved that there exist encoding schemes which are arbitrarily as efficient as the bin...
Abstract — We outline a procedure for using pseudorandom generators to construct binary codes with g...
AbstractSince the pioneering work of Cook and Karp, an extensive effort has been made in identifying...
AbstractWe study the average-case hardness of the class NP against algorithms in P. We prove that th...
Linear programming (LP) decoding for low-density parity-check codes (and related domains such as com...
AbstractWe prove the following about the Nearest Lattice Vector Problem (in anylpnorm), the Nearest ...
We examine new approaches to the problem of decoding general linear codes under the strategies of fu...
The problem of exact maximum-likelihood (ML) decoding of general linear codes is well-known to be NP...
Linear programming decoding for low-density parity check codes (and related domains such as compress...