Keyword

minimum distance

Description: The smallest distance between distinct elements in a set or structure, with its precise meaning depending on the mathematical context.

Primary topic: Coding theory and cryptography (55%)

OpenAlex ID: keywords/minimum-distance

Low-density parity-check codes

1962 · R. Gallager · IEEE Transactions on Information Theory · 10,723

Low-density parity-check codes based on finite geometries: a rediscovery and new results

2001 · Y. Kou, S. Lin, et al. · IEEE Transactions on Information Theory · 1,303

digital phase modulation

2011 · Anderson, John B, Aulin, Tor, et al. · SpringerReference · 887

On the Locality of Codeword Symbols

2012 · Parikshit Gopalan, Cheng Huang, et al. · IEEE Transactions on Information Theory · 832

Algebraic coding theory

2008 · Norman L. Biggs · Springer undergraduate mathematics series · 751

Probability Metrics and the Stability of Stochastic Models

1992 · Jim Freeman, Svetlozar T. Rachev · Journal of the Operational Research Society · 723

XORing elephants

2013 · Maheswaran Sathiamoorthy, Megasthenis Asteris, et al. · Proceedings of the VLDB Endowment · 690

Maximum distanceq-nary codes

1964 · R. Singleton · IEEE Transactions on Information Theory · 534

Bandwidth-efficient turbo trellis-coded modulation using punctured component codes

1998 · P. Robertson, T. Worz · IEEE Journal on Selected Areas in Communications · 467

New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities

1977 · R. McEliece, E. Rodemich, et al. · IEEE Transactions on Information Theory · 447

Binary codes with specified minimum distance

1960 · M. Plotkin · IEEE Transactions on Information Theory · 364

Weight distributions for turbo codes using random and nonrandom permutations

1995 · S. Dolinar, D. Divsalar · 355

A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511

1998 · A. Canteaut, F. Chabaud · IEEE Transactions on Information Theory · 350

A new upper bound on the minimal distance of self-dual codes

1990 · J.H. Conway, N.J.A. Sloane · IEEE Transactions on Information Theory · 348

Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength

2014 · Jean-Pierre Tillich, Gilles Zemor · IEEE Transactions on Information Theory · 341

PDF

Improved quasi-orthogonal codes through constellation rotation

2003 · N. Sharma, C.B. Papadias · IEEE Transactions on Communications · 336

Optimization of Two-Dimensional Signal Constellations in the Presence of Gaussian Noise

1974 · G. Foschini, R. Gitlin, et al. · IRE Transactions on Communications Systems · 332

Dual-Mode Index Modulation Aided OFDM

2016 · Tianqi Mao, Zhaocheng Wang, et al. · IEEE Access · 318

Class of constructive asymptotically good algebraic codes

1972 · J. Justesen · IEEE Transactions on Information Theory · 294

On Optimal Quantum Codes

2004 · MARKUS GRASSL, THOMAS BETH, et al. · International Journal of Quantum Information · 285

PDF

Illuminating the structure of code and decoder of parallel concatenated recursive systematic (turbo) codes

2002 · P. Robertson · Globecom · 280

On subfield subcodes of modified Reed-Solomon codes (Corresp.)

1975 · P. Delsarte · IEEE Transactions on Information Theory · 277

Interleavers for turbo codes using permutation polynomials over integer rings

2005 · Jing Sun, O.Y. Takeshita · IEEE Transactions on Information Theory · 270

Complementary dual codes for counter-measures to side-channel attacks

2016 · Claude Carlet, Sylvain Guilley · Advances in Mathematics of Communications · 266

Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima

2009 · Vladimir Kolesnikov, Ahmad-Reza Sadeghi, et al. · Lecture notes in computer science · 265

Works count: 4,871

Citation count: 71,720