Fetching the paper…
Reading the bibliography…
In this article we revisit smoothing bounds in parallel between lattices $and$ codes.
New upper bounds for codes correcting errors
LA Bassalygo · 1965
Earlier work this paper cites.
New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
Robert J. McEliece, Eugene R. Rodemich, Howard Rumsey Jr., and Lloyd R. Welch · 1977
Earlier work this paper cites.
Bounds for packings on a sphere and in space
Grigory Kabatiansky and Vladimir I. Levenshtein · 1978
Earlier work this paper cites.
A Public-Key System Based on Algebraic Coding Theory
Robert J. McEliece · 1978
Earlier work this paper cites.
On bounds for packings in n n -dimensional euclidean space
Vladimir I. Levenshtein · 1979
Earlier work this paper cites.
New bounds in some transference theorems in the geometry of numbers
Wojciech Banaszczyk · 1993
Earlier work this paper cites.
Krawtchouk polynomials and universal bounds for codes and designs in hamming spaces
Vladimir I. Levenshtein · 1995
Earlier work this paper cites.
Spectral graph theory
Fan R. K. Chung · 1997
Earlier work this paper cites.
Association schemes and coding theory
Philippe Delsarte and Vladimir Iossifovitch Levenshtein · 1998
Earlier work this paper cites.
Strong asymptotics for Krawtchouk polynomials
Mourad E.H. Ismail and Plamen Simeonov · 1998
Earlier work this paper cites.
Introduction to coding theory
Jacobus Hendricus van Lint · 1999
Cited alongside, same era.
Estimates of the distance distribution of codes and designs
Alexei E. Ashikhmin, Alexander Barg, and Simon Litsyn · 2001
Cited alongside, same era.
New upper bounds on sphere packings I
Henry Cohn and Noam Elkies · 2003
Cited alongside, same era.
Bounds on distance distributions in codes of known size
Alexei E. Ashikhmin, Gérard D. Cohen, Michael Krivelevich, and Simon Litsyn · 2005
Cited alongside, same era.
Uniform bounds for bessel functions
Ilia Krasikov · 2006
Cited alongside, same era.
Codes for Error Detection
Torleiv Kløve · 2007
Cited alongside, same era.
Worst-case to average-case reductions based on Gaussian measures
MDPC-McEliece: New McEliece variants from moderate density parity-check codes
Rafael Misoczki, Jean-Pierre Tillich, Nicolas Sendrier, and Paulo S. L. M. Barreto · 2013
Later among the works it cites.
Semantically secure lattice codes for the Gaussian wiretap channel
Cong Ling, Laura Luzzi, Jean-Claude Belfiore, and Damien Stehlé · 2014
Later among the works it cites.
Lattice Coding for Signals and Networks: A Structured Coding Approach to Quantization, Modulation and Multiuser Information Theory
Ram Zamir · 2014
Later among the works it cites.
Solving the shortest vector problem in 2 n 2^{n} time using discrete Gaussian sampling
Divesh Aggarwal, Daniel Dadush, Oded Regev, and Noah Stephens-Davidowitz · 2015
Later among the works it cites.
Thomas Debris-Alazard and Jean-Pierre Tillich · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Daniele Micciancio and Oded Regev · 2007
Cited alongside, same era.
Trapdoors for hard lattices and new cryptographic constructions
Craig Gentry, Chris Peikert, and Vinod Vaikuntanathan · 2008
Cited alongside, same era.
Solving the shortest lattice vector problem in time 2 2.465n {}^{\mbox{2.465n}}
Xavier Pujol and Damien Stehlé · 2009
Cited alongside, same era.
More on average case vs approximation complexity
Michael Alekhnovich · 2011
Cited alongside, same era.
Worst-case hardness for LPN and cryptographic hashing via code smoothing
Zvika Brakerski, Vadim Lyubashevsky, Vinod Vaikuntanathan, and Daniel Wichs · 2019
Later among the works it cites.
Wave: A new family of trapdoor one-way preimage sampleable functions based on codes
Thomas Debris-Alazard, Nicolas Sendrier, and Jean-Pierre Tillich · 2019
Later among the works it cites.
High-dimensional statistics: A non-asymptotic viewpoint
Martin J Wainwright · 2019
Later among the works it cites.
Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
Yu Yu and Jiang Zhang · 2021
Later among the works it cites.
Secret key generation from Gaussian sources using lattice-based extractors
Laura Luzzi, Cong Ling, and Matthieu R. Bloch · 2022
Closest in time.