Subspace Codes

Subspace Codes is a type of error-correcting code in which the codewords are subspaces of a vector space over a finite field, endowed with a metric based on the subspace distance, enabling robust communication in network coding under errors and erasures.

127

Publications

4.6K

Citations

205

Authors

150

Institutions

Publications per year

2017–2026

55

Authors

205

  1. SK
    Sascha Kurz

    University of Bayreuth, Germany

    6 publications · 176 citations

    6

    h-index

  2. TE
    Tuvi Etzion

    Technion – Israel Institute of Technology, Israel

    6 publications · 189 citations

    6

    h-index

  3. VG
    Venkatesan Guruswami

    Carnegie Mellon University, United States

    5 publications · 136 citations

    5

    h-index

  4. AV
    Alexander Vardy

    University of California San Diego, United States

    4 publications · 83 citations

    4

    h-index

  5. FZ
    Ferdinando Zullo

    University of Campania "Luigi Vanvitelli", Italy

    4 publications · 88 citations

    4

    h-index

1–5 of 205

Venues

  1. IEEE Transactions on Information Theory

    31 publications · 1.3K citations

    20

    h-index

  2. Discrete Mathematics

    6 publications · 153 citations

    6

    h-index

  3. arXiv (Cornell University)

    Repository · 6 publications · 133 citations

    6

    h-index

  4. IEEE Communications Letters

    4 publications · 76 citations

    4

    h-index

  5. Advances in Mathematics of Communications

    4 publications · 91 citations

    4

    h-index

1–5