Suchergebnisse - "sub-linear decoding complexity"

  • Treffer 1 - 2 von 2
Treffer weiter einschränken
  1. 1

    SAFFRON: A Fast, Efficient, and Robust Framework for Group Testing Based on Sparse-Graph Codes.

    Autoren: Lee, Kangwook Chandrasekher, Kabir Pedarsani, Ramtin et al.

    Quelle: IEEE Transactions on Signal Processing. 9/1/2019, Vol. 67 Issue 17, p4649-4664. 16p.

    Schlagwörter: *CODING theory, *SAFFRON crocus, *CIPHERS, *NOISE measurement

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  2. 2

    Sub-linear time compressed sensing for support recovery using left and right regular sparse-graph codes.

    Autoren: Vem, Avinash Janakiraman, Nagaraj Thenkarai Narayanan, Krishna

    Quelle: 2016 IEEE Information Theory Workshop (ITW); 2016, p429-433, 5p

    Full Text Finder
    Zu den Favoriten

Suchwerkzeuge: