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

Authors

142

  1. ID
    Ilya Dumer

    University of California, Riverside, United States

    5 publications · 153 citations

    5

    h-index

  2. YB
    Y. Be'ery

    Tel Aviv University, Israel

    4 publications · 89 citations

    4

    h-index

  3. OA
    Ofer Amrani

    Tel Aviv University, Israel

    4 publications · 89 citations

    4

    h-index

  4. AV
    Alexander Vardy

    University of California San Diego, United States

    4 publications · 237 citations

    4

    h-index

  5. CL
    Cong Ling

    Imperial College London, United Kingdom

    3 publications · 133 citations

    3

    h-index

1–5 of 142

Venues

  1. IEEE Transactions on Information Theory

    39 publications · 3.5K citations

    27

    h-index

  2. IEEE Transactions on Communications

    9 publications · 441 citations

    9

    h-index

  3. Designs Codes and Cryptography

    2 publications · 29 citations

    2

    h-index

  4. SIAM Journal on Computing

    2 publications · 136 citations

    2

    h-index

  5. Finite Fields and Their Applications

    2 publications · 31 citations

    2

    h-index

1–5