Parity-check Matrices

Parity-Check Matrices is a mathematical construct in coding theory that defines a linear transformation enabling the systematic verification of data integrity in erasure-correcting codes by mapping codewords to a syndrome space whose nullspace characterizes valid encodings.

1.2K

Publications

84.1K

Citations

2K

Authors

740

Institutions

Publications per year

2017–2026

174

Authors

2K

  1. SL
    Shu Lin

    University of California, Davis, United States

    30 publications · 1.6K citations

    20

    h-index

  2. KA
    Khaled Abdel-Ghaffar

    University of California, Davis, United States

    31 publications · 1.1K citations

    19

    h-index

  3. AH
    Amir H. Banihashemi

    Carleton University, Canada

    22 publications · 1.1K citations

    17

    h-index

  4. BV
    Bane Vasić

    University of Arizona, United States

    15 publications · 655 citations

    14

    h-index

  5. QH
    Qin Huang

    Beihang University, China

    13 publications · 418 citations

    12

    h-index

1–5 of 2K

Venues

  1. IEEE Transactions on Information Theory

    215 publications · 31.1K citations

    64

    h-index

  2. IEEE Transactions on Communications

    77 publications · 3.9K citations

    33

    h-index

  3. IEEE Communications Letters

    75 publications · 2.7K citations

    30

    h-index

  4. Designs Codes and Cryptography

    38 publications · 1.1K citations

    20

    h-index

  5. Discrete Mathematics

    33 publications · 1.6K citations

    17

    h-index

1–5