Wei Liu 0105

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▷ joint publications with Seyed Hamed Hassani

> Home > Persons > Wei Liu 0105

Publications

2017
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/isit/AchlioptasHLU17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isit/AchlioptasHLU17
Dimitris Achlioptas, S. Hamed Hassani, Wei Liu, Rüdiger L. Urbanke:
Time-invariant LDPC convolutional codes. ISIT 2017: 366-370
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/AchlioptasHLU17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/AchlioptasHLU17
Dimitris Achlioptas, Seyed Hamed Hassani, Wei Liu, Rüdiger L. Urbanke:
Time-Invariant LDPC Convolutional Codes. CoRR abs/1702.04539 (2017)
2013
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/itw/LiuHU13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/itw/LiuHU13
Wei Liu, Seyed Hamed Hassani, Rüdiger L. Urbanke:
The least degraded and the least upgraded channel with respect to a channel family. ITW 2013: 1-5
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1304-5150
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1304-5150
Wei Liu, Seyed Hamed Hassani, Rüdiger L. Urbanke:
The Least Degraded and the Least Upgraded Channel with respect to a Channel Family. CoRR abs/1304.5150 (2013)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.