Stephen B. Wicker

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 Lars K. Rasmussen

> Home > Persons > Stephen B. Wicker

Publications

1995
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/tcom/RasmussenW95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcom/RasmussenW95
Lars K. Rasmussen, Stephen B. Wicker:
Trellis-coded, type-I hybrid-ARQ protocols based on CRC error-detecting codes. IEEE Trans. Commun. 43(10): 2569-2575 (1995)
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/wpc/RasmussenBW95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/wpc/RasmussenBW95
Lars K. Rasmussen, Michael J. Bartz, Stephen B. Wicker:
A comparison of trellis coded and Reed-Solomon coded hybrid-ARQ protocols over slowly fading Rayleigh channels. Wirel. Pers. Commun. 2(4): 393-413 (1995)
1994
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/tit/RasmussenW94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/RasmussenW94
Lars K. Rasmussen, Stephen B. Wicker:
The performance of type-I trellis coded hybrid-ARQ protocols over AWGN and slowly fading channels. IEEE Trans. Inf. Theory 40(2): 418-428 (1994)
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/pimrc/RasmussenW94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pimrc/RasmussenW94
Lars K. Rasmussen, Stephen B. Wicker:
A performance analysis for two TCM code combining diversity receivers. PIMRC 1994: 85-89

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.