Computational Hardness and Explicit Constructions of Error Correcting Codes (original) (raw)
Related papers
A survey of constructive coding theory, and a table of binary codes of highest known rate
Discrete Mathematics, 1972
Some bounds for the minimum length of binary linear codes of dimension nine
IEEE Transactions on Information Theory, 2000
On some classes of optimal and near-optimal polynomial codes
Finite Fields and Their Applications, 2004
Perfect binary codes: constructions, properties, and enumeration
IEEE Transactions on Information Theory, 1994
Construction Methods of Optimal Codes from Combinatorial Designs
2011
On some linear codes that are proper for error detection
2012 Information Theory and Applications Workshop, 2012
Algorithmic issues in coding theory
Lecture Notes in Computer Science, 1997
On the Complexity of the Greedy Construction of Linear Error-Correcting Codes
ICT Innovations 2009, 2010
Unique Decoding of Explicit -balanced Codes Near the Gilbert-Varshamov Bound
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020
Error-Correcting Codes in Projective Space
IEEE Transactions on Information Theory, 2011
Every bad code has a good subcode: A local converse to the coding theorem
Zeitschrift f�r Wahrscheinlichkeitstheorie und Verwandte Gebiete, 1976
Hardness of approximating the minimum distance of a linear code
IEEE Transactions on Information Theory, 2003
On upper bounds for the size of codes in polynomial metric spaces
On the NP-hardness of bounded distance decoding of Reed-Solomon codes
2015 IEEE International Symposium on Information Theory (ISIT), 2015
On the Bounds of certain Maximal Linear Codes in a Projective Space.
Unique Decoding of Explicit ε-balanced Codes Near the Gilbert-Varshamov Bound
ArXiv, 2020
On the threshold of Maximum-Distance Separable codes
Gerard Cohen, Herve Chabanne, Bruno Kindarji
2010 IEEE International Symposium on Information Theory, 2010
The Parametrized Complexity of Some Fundamental Problems in Coding Theory
SIAM Journal on Computing, 1999
SOME NEW RESULTS ON BINARY LINEAR BLOCK CODES
Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound
Cryptography and Communications, 2021
On the Relative Generalized Hamming Weights of Linear Codes and their Subcodes
Siam Journal on Discrete Mathematics, 2010
CONSTRUCTION OF QUASI-CYCLIC CODES
1989
Some long cyclic linear binary codes are not so bad
IEEE Transactions on Information Theory, 1974
On Random Error Correcting Codes Based on Quasigroups
2011
Error-Correction Capability of Binary Linear Codes
IEEE Transactions on Information Theory, 2005
Improved bounds on identifying codes in binary Hamming spaces
European Journal of Combinatorics, 2010
On the list and bounded distance decodibility of Reed-Solomon codes
2004
A characterization of 1-perfect additive codes
IEEE Transactions on Information Theory, 1999
On the List and Bounded Distance Decodability of Reed-Solomon Codes
Siam Journal on Computing, 2007
Minimal binary linear codes: a general framework based on bent concatenation
Designs, Codes and Cryptography
A Cryptographic System Based on a New Class of Binary Error-Correcting Codes
Tatra Mountains Mathematical Publications, 2019