Revisiting Nearest-Neighbor-Based Information Set Decoding
Author:
- 4 December 2023
- book chapter
- Published by Springer Nature
- p. 34-54
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Analysis of Information Set Decoding for a Sub-linear Error Weight2016
- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes2015
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding2012
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$2011
- Smaller Decoding Exponents: Ball-Collision Decoding2011
- A method for finding codewords of small weight2005
- Approximate nearest neighbors1998
- A probabilistic algorithm for computing minimum weights of large error-correcting codesIEEE Transactions on Information Theory, 1988
- The use of information sets in decoding cyclic codesIEEE Transactions on Information Theory, 1962
- A Comparison of Signalling AlphabetsBell System Technical Journal, 1952