skip to main content


Search for: All records

Creators/Authors contains: "Love, David J."

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Free, publicly-accessible full text available November 28, 2024
  2. Free, publicly-accessible full text available October 1, 2024
  3. Free, publicly-accessible full text available October 1, 2024
  4. Free, publicly-accessible full text available August 1, 2024
  5. This work considers the problem of sending a 1-bit message over an acyclic network, where the “edge” connecting any two nodes is a memoryless binary-input/symmetric-output (BISO) channel. For any arbitrary acyclic network topology and constituent channel models, a min-cut-based converse of the learning rate, denoted by r^*, is derived. It is then shown that for any r < r^*, one can design a scheme with learning rate r. Capable of approaching the optimal r^*, the proposed scheme is thus the asymptotically fastest for sending one bit over any acyclic BISO-channel network. The construction is based on a new concept of Lossless Amplify-&-Forward, a sharp departure from existing multi-hop communication scheme designs. 
    more » « less
    Free, publicly-accessible full text available June 25, 2024
  6. Free, publicly-accessible full text available September 1, 2024
  7. Free, publicly-accessible full text available June 25, 2024
  8. Free, publicly-accessible full text available July 10, 2024
  9. Free, publicly-accessible full text available June 1, 2024
  10. Free, publicly-accessible full text available May 23, 2024