Minimum Distance is the smallest Hamming distance between any two distinct codewords in a block code, serving as a fundamental parameter that determines the error-detecting and error-correcting capabilities of the code.
2.9K
Publications
161.6K
Citations
5.9K
Authors
1.9K
Institutions
Publications per year
2017–2026
525
Parents
Publications
2.9K
Low-density parity-check codes
Robert G. Gallager · IEEE Transactions on Information Theory · 1962 · 10.6K citations · Full text
An Operational Analysis of Traffic Dynamics
Louis A. Pipes · Journal of Applied Physics · 1953 · 1.3K citations
1–5 of 2.9K
Authors
5.9K
- DJ
19
h-index
- PV
16
h-index
- DG
15
h-index
- ML
15
h-index
- GZ
15
h-index
1–5 of 5.9K
Institutions
1.9K
University of California San Diego
San Diego, United States
24 h-index
60 publications
3.3K citations
Centre National de la Recherche Scientifique
Paris, France
23 h-index
79 publications
4.1K citations
University of Southern California
Los Angeles, United States
23 h-index
53 publications
4.2K citations
University of Illinois Urbana-Champaign
Urbana, United States
23 h-index
53 publications
4.4K citations
Technion – Israel Institute of Technology
Haifa, Israel
21 h-index
42 publications
1.7K citations
California Institute of Technology
Pasadena, United States
20 h-index
43 publications
3.8K citations
Tsinghua University
Beijing, China
20 h-index
75 publications
4.1K citations
Lund University
Lund, Sweden
20 h-index
57 publications
3.9K citations
1–8 of 1.9K
Venues
- IEEE Transactions on Information Theory
518 publications · 48.2K citations
85
h-index
- IEEE Transactions on Communications
71 publications · 2.9K citations
28
h-index
- IEEE Communications Letters
42 publications · 1.5K citations
23
h-index
- IEEE Access
23 publications · 1.3K citations
19
h-index
- IEEE Transactions on Wireless Communications
24 publications · 883 citations
19
h-index
1–5