skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 2

Search for: All records

Award ID contains: 1711056

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. ; ; (, 2021 17th International Symposium on Wireless Communication Systems (ISWCS))
    Full Text Available 
  2. ; ; (, IEEE Journal on Selected Areas in Information Theory)
    Full Text Available 
  3. ; ; (, IEEE International Symposium on Information Theory)
    Accepted Manuscript Full Text Available
  4. ; ; ; (, IEEE International Symposium on Information Theory)
    Accepted Manuscript Full Text Available
  5. ; ; (, Advances in neural information processing systems)
    null (Ed.)
    Accepted Manuscript Full Text Available
  6. ; ; (, Advances in neural information processing systems)
    null (Ed.)
    Accepted Manuscript Full Text Available
  7. ; ; (, 2019 IEEE Information Theory Workshop (ITW))
    Linear nested codes, where two or more subcodes are nested in a global code, have been proposed as candidates for reliable multi-terminal communication. In this paper, we consider nested array-based spatially coupled LDPC codes and propose a line-counting based optimization scheme for minimizing the number of dominant absorbing sets in order to improve its performance in the high signal-to-noise ratio regime. The presented multi-step optimization process is applied first to one of the nested codes, then an optimization of the remaining nested codes is carried out based on these code constraints. We also show that for certain code parameters, dominant absorbing sets in the Tanner graphs of all nested codes can be completely removed using our proposed optimization strategy. 
    more » « less
    Full Text Available 
  8. ; ; (, IEEE International Symposium on Information Theory)
    Accepted Manuscript Full Text Available
  9. ; ; (, IEEE Transactions on Communications)
    Full Text Available 
  10. ; (, IEEE Information Theory Workshop)
    Full Text Available