Discrete Memoryless Channels

A Discrete Memoryless Channel is a communication channel model characterized by a fixed input-output alphabet and a transition probability matrix, where the output at any given time depends solely on the current input and not on previous inputs or outputs, embodying the memoryless property in discrete-time stochastic systems.

666

Publications

71.6K

Citations

773

Authors

316

Institutions

Publications per year

2017–2026

65

Variants

DmcDmcs

Authors

773

  1. HV
    H. Vincent Poor

    Princeton University, United States

    26 publications · 2.1K citations

    18

    h-index

  2. SS
    Shlomo Shamai

    Technion – Israel Institute of Technology, Israel

    16 publications · 1.4K citations

    14

    h-index

  3. TW
    Tsachy Weissman

    Stanford University, United States

    16 publications · 381 citations

    14

    h-index

  4. AE
    Abbas El Gamal

    Stanford University, United States

    14 publications · 1.8K citations

    13

    h-index

  5. MR
    Matthieu R. Bloch

    Georgia Institute of Technology, United States

    16 publications · 821 citations

    13

    h-index

1–5 of 773

Venues

  1. IEEE Transactions on Information Theory

    263 publications · 42.1K citations

    88

    h-index

  2. IEEE Transactions on Communications

    13 publications · 892 citations

    13

    h-index

  3. arXiv (Cornell University)

    Repository · 22 publications · 342 citations

    13

    h-index

  4. 11

    h-index

  5. ArXiv.org

    Repository · 14 publications · 316 citations

    11

    h-index

1–5