Linear Codes
Linear Code is a subspace of a finite-dimensional vector space over a finite field, distinguished by its closure under vector addition and scalar multiplication, enabling systematic encoding and error detection through linear algebraic structure.
2.5K
Publications
139.3K
Citations
3K
Authors
1.1K
Institutions
Publications per year
2017–2026
430
Variants
Linear Code
2.5K
On lattices, learning with errors, random linear codes, and cryptography
Oded Regev · 2005 · 2.2K citations
On lattices, learning with errors, random linear codes, and cryptography
Oded Regev · Journal of the ACM · 2009 · 2.2K citations
1–5 of 2.5K
3K
Hong Kong University of Science and Technology, Hong Kong SAR China
44 publications · 4.1K citations
32
h-index
20
h-index
19
h-index
19
h-index
18
h-index
1–5 of 3K
1.1K

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
31 h-index
56 publications
5.1K citations

Centre National de la Recherche Scientifique
Paris, France
30 h-index
119 publications
6.5K citations
Technion – Israel Institute of Technology
Haifa, Israel
28 h-index
66 publications
4.2K citations
Massachusetts Institute of Technology
Cambridge, United States
26 h-index
66 publications
6.4K citations

Nanjing University of Aeronautics and Astronautics
Nanjing, China
25 h-index
78 publications
2.9K citations
University of California San Diego
San Diego, United States
24 h-index
64 publications
3.2K citations
Eindhoven University of Technology
Eindhoven, The Netherlands
24 h-index
60 publications
5.6K citations
California Institute of Technology
Pasadena, United States
23 h-index
62 publications
5.5K citations
1–8 of 1.1K
789 publications · 64.9K citations
112
h-index
136 publications · 4.3K citations
35
h-index
75 publications · 2.9K citations
32
h-index
69 publications · 3.3K citations
29
h-index
68 publications · 2.5K citations
27
h-index
1–5