On the complexity of some coding problems (Corresp.)

DOI10.1109/TIT.1981.1056419zbMath0465.94021MaRDI QIDQ3918030

S. Louis Hakimi, Simeon C. Ntafos

Publication date: 1981

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

zbMATH Keywords

NP-hardbinary linear codefinding a codeword with least weight

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear codes (general theory) (94B05)

Related Items

Factorization properties of lattices over the integers ⋮ Solving linear equations parameterized by Hamming weight ⋮ Unnamed Item ⋮ Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders ⋮ Sur la complexité d'un problème de codage ⋮ The covering radius of the cycle code of a graph ⋮ Fault-detection in networks ⋮ Boolean autoencoders and hypercube clustering complexity ⋮ MOD-2 INDEPENDENCE AND DOMINATION IN GRAPHS ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems)