Ordered Binary Decision Diagrams and Minimal Trellises
IEEE Transactions on Computers
How to Achieve a McEliece-Based Digital Signature Scheme
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Mod-2 Independence and Domination in Graphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Semantically Secure McEliece Public-Key Cryptosystems-Conversions for McEliece PKC
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
On the Gröbner bases of some symmetric systems and their application to coding theory
Journal of Symbolic Computation
Hardness of Approximating the Minimum Distance of a Linear Code
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The inapproximability of lattice and coding problems with preprocessing
Journal of Computer and System Sciences - Special issue on computational complexity 2002
Maximum-likelihood decoding of Reed-Solomon codes is NP-hard
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Algorithms (TALG)
Kleptographic attacks on a cascade of mix servers
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
A search algorithm for linear codes: progressive dimension growth
Designs, Codes and Cryptography
On the (co)girth of a connected matroid
Discrete Applied Mathematics
A method for efficiently computing the number of codewords of fixed weights in linear codes
Discrete Applied Mathematics
A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
A deterministic reduction for the gap minimum distance problem: [extended abstract]
Proceedings of the forty-first annual ACM symposium on Theory of computing
How Reed-Solomon codes can improve steganographic schemes
EURASIP Journal on Information Security - Special issue on secure steganography in multimedia content
Proceedings of the 10th ACM conference on Electronic commerce
Provably good codes for hash function design
IEEE Transactions on Information Theory
Finding all small error-prone substructures in LDPC codes
IEEE Transactions on Information Theory
Reversible low-density parity-check codes
IEEE Transactions on Information Theory
An efficient algorithm to find all small-size stopping sets of low-density parity-check matrices
IEEE Transactions on Information Theory
Probabilistic versus deterministic algebraic cryptanalysis: a performance comparison
IEEE Transactions on Information Theory
Provably good codes for hash function design
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
How can reed-Solomon codes improve steganographic schemes?
IH'07 Proceedings of the 9th international conference on Information hiding
On the hardness of approximating stopping and trapping sets
IEEE Transactions on Information Theory
Minimum distance computation of LDPC codes using a branch and cut algorithm
IEEE Transactions on Communications
Minimum distance lower bounds for girth-constrained RA code ensembles
IEEE Transactions on Communications
Network coding tomography for network failures
INFOCOM'10 Proceedings of the 29th conference on Information communications
Proceedings of the 11th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing on International Conference on Computer Systems and Technologies
A simple deterministic reduction for the gap minimum distance of code problem
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Problems of Information Transmission
A Note on Edge-based Graph Partitioning and its Linear Algebraic Structure
Journal of Mathematical Modelling and Algorithms
Hardness of approximation results for the problem of finding the stopping distance in tanner graphs
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Finding good differential patterns for attacks on SHA-1
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Designing an efficient and secure public-key cryptosystem based on reducible rank codes
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Designing a rank metric based mceliece cryptosystem
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
Ensuring message embedding in wet paper steganography
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Stopping set distributions of algebraic geometry codes from elliptic curves
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
| Hi-index | 755.20 |
It is shown that the problem of computing the minimum distance of a binary linear code is NP-hard, and the corresponding decision problem is NP-complete. This result constitutes a proof of the conjecture of Berlekamp, McEliece, and van Tilborg (1978). Extensions and applications of this result to other problems in coding theory are discussed