default search action
Samir Kallel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2000
- [j19]A. Alavi, Robert Link, Samir Kallel:
Adaptive unequal error protection for subband image coding. IEEE Trans. Broadcast. 46(3): 197-205 (2000) - [j18]Robert Link, Samir Kallel:
Optimal use of Markov models for DPCM picture transmission over noisy channels. IEEE Trans. Commun. 48(10): 1702-1711 (2000) - [j17]Robert Link, Samir Kallel:
Markov model aided decoding for image transmission using soft-decision-feedback. IEEE Trans. Image Process. 9(2): 190-196 (2000) - [j16]Samir Kallel, Sattar Bakhtiyari, Robert Link:
An Adaptive Hybrid ARQ Scheme. Wirel. Pers. Commun. 12(3): 297-311 (2000)
1990 – 1999
- 1999
- [j15]Kaiping Li, Samir Kallel:
A bidirectional multiple stack algorithm. IEEE Trans. Commun. 47(1): 6-9 (1999) - [c2]Amanda Wang, Jean-Jacques Werner, Samir Kallel:
Effect of bridged taps on channel capacity at VDSL frequencies. ICC 1999: 236-245 - 1998
- [j14]David Kwan, Samir Kallel:
A truncated best-path algorithm. IEEE Trans. Commun. 46(5): 568-572 (1998) - [j13]David Kwan, Samir Kallel:
A rate-k/n heuristic soft-output Viterbi algorithm (SOVA) that is postdetector-compatible. IEEE Trans. Commun. 46(5): 621-626 (1998) - 1997
- [j12]Samir Kallel, Kaipin Li:
Bidirectional sequential decoding. IEEE Trans. Inf. Theory 43(4): 1319-1326 (1997) - 1995
- [j11]Samir Kallel:
Complementary punctured convolutional (CPC) codes and their applications. IEEE Trans. Commun. 43(6): 2005-2009 (1995) - [j10]Cuong Hon Lai, Samir Kallel:
An efficient convolutional coding/decoding strategy for channels with memory. IEEE Trans. Commun. 43(11): 2678-2686 (1995) - 1994
- [j9]Siavash M. Alamouti, Samir Kallel:
Adaptive trellis-coded multiple-phase-shift keying for Rayleigh fading channels. IEEE Trans. Commun. 42(6): 2305-2314 (1994) - [j8]Samir Kallel:
Efficient hybrid ARQ protocols with adaptive forward error correction. IEEE Trans. Commun. 42(234): 281-289 (1994) - 1992
- [j7]Samir Kallel, Cyril Leung:
Efficient ARQ schemes with multiple copy decoding. IEEE Trans. Commun. 40(3): 642-650 (1992) - [j6]Samir Kallel:
Analysis of memory and incremental redundancy ARQ schemes over a nonstationary channel. IEEE Trans. Commun. 40(9): 1474-1480 (1992) - [j5]Samir Kallel:
Sequential decoding with an efficient incremental redundancy ARQ scheme. IEEE Trans. Commun. 40(10): 1588-1593 (1992) - 1991
- [j4]Samir Kallel, David Haccoun:
Sequential decoding with an efficient partial retransmission ARQ strategy. IEEE Trans. Commun. 39(2): 208-213 (1991) - [c1]Samir Kallel, C. Leung:
An Adaptive Incremental Redundancy Selective-Repeat ARQ Scheme for Finite Buffer Receivers. INFOCOM 1991: 791-796 - 1990
- [j3]Samir Kallel:
Analysis of a type II hybrid ARQ scheme with code combining. IEEE Trans. Commun. 38(8): 1133-1137 (1990) - [j2]Samir Kallel, David Haccoun:
Generalized type II hybrid ARQ scheme using punctured convolutional coding. IEEE Trans. Commun. 38(11): 1938-1946 (1990)
1980 – 1989
- 1988
- [j1]Samir Kallel, David Haccoun:
Sequential decoding with ARQ and code combining: a robust hybrid FEC/ARQ system. IEEE Trans. Commun. 36(7): 773-780 (1988)
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint