The complexity of information set decoding

DOI10.1109/18.57202zbMath0738.94021OpenAlexW2108139581MaRDI QIDQ3986470

Rodney M. Goodman, John T. Coffey

Publication date: 27 June 1992

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

Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:20190314-142000507

zbMATH Keywords

complexityinformation set decodingbounded hard-decision decodingbounded soft-decision decodingcomplete minimum distance decoding

Mathematics Subject Classification ID

Decoding (94B35)

Related Items

Information set decoding in the Lee metric with applications to cryptography, Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes, Time-Memory Tradeoffs for Large-Weight Syndrome Decoding in Ternary Codes, An algorithm for generalized syndrome decoding problem, Improved information set decoding algorithms over Galois ring in the Lee metric, Information sets in abelian codes: defining sets and Groebner basis, Code-Based Cryptosystems Using Generalized Concatenated Codes, New approaches to reduced-complexity decoding, Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$, On the complexity of suboptimal decoding for list and decision feedback schemes