Bounded Distance Decoding Problem
The Bounded Distance Decoding Problem is a computational lattice problem that consists in finding the closest lattice vector to a given target point, provided that the target is within a bounded distance strictly less than half the minimum distance of the lattice, thus distinguishing it from general nearest codeword problems.
81
Publications
4.9K
Citations
142
Authors
111
Institutions
Publications per year
2017–2026
9
Parents
81
Capabilities of Bounded Discrepancy Decoding
A.D. Wyner · Bell System Technical Journal · 1965 · 126 citations
1–5 of 81
142
5
h-index
4
h-index
4
h-index
4
h-index
3
h-index
1–5 of 142
111

Tel Aviv University
Tel Aviv, Israel
6 h-index
13 publications
253 citations
University of Illinois Urbana-Champaign
Urbana, United States
5 h-index
6 publications
270 citations
University of California, Berkeley
Berkeley, United States
4 h-index
6 publications
767 citations
University of California, Riverside
Riverside, United States
4 h-index
5 publications
163 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
3 h-index
4 publications
123 citations
Institute for Information Transmission Problems
Moscow, Russia
3 h-index
4 publications
88 citations
Technical University of Denmark
Kongens Lyngby, Denmark
3 h-index
5 publications
271 citations

Imperial College London
London, United Kingdom
3 h-index
5 publications
224 citations
1–8 of 111
39 publications · 3.5K citations
27
h-index
9 publications · 441 citations
9
h-index
2 publications · 29 citations
2
h-index
2 publications · 136 citations
2
h-index
2 publications · 31 citations
2
h-index
1–5