default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean Conan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j12]Mohammad Torabi, Jean Conan:
Performance analysis of orthogonal space-time block coding with antenna selection. IET Commun. 9(10): 1298-1305 (2015)- [j11]Ali Jemmali, Mohammad Torabi, Jean Conan:
Performance Analysis of MIMO Schemes in 3GPP Long Term Evolution System. Wirel. Pers. Commun. 82(2): 1107-1125 (2015)
2000 – 2009
- 2008
- [c8]Oualid Chaker, Jean Conan:
Multicast Ad Hoc Networks: A Constructive Lower Bound on Throughput Capacity. EW 2008 - [c7]Oualid Chaker, Jean Conan:
An achievable capacity for hierarchical multicast ad hoc networks. PIMRC 2008: 1-5 - [c6]Jean Conan, Vanja Subotic:
Bidirectional stochastic channel models are in general WSSUS. PIMRC 2008: 1-5 - 2007
- [c5]Oualid Chaker, Jean Conan:
Multicast Capacity of Wireless Ad Hoc Networks with Hierarchical Routing. VTC Spring 2007: 95-99 - 2005
- [c4]Oualid Chaker, Jean Conan:
Bounds on throughput capacity of MANETs. ICCCN 2005: 593 - 2000
- [c3]Thierry Rancurel, Daniel Roviras, Jean Conan, Francis Castanie:
Effect of interleaving on a Gilbert channel. EUSIPCO 2000: 1-3 - [c2]Thierry Rancurel, Daniel Roviras, Jean Conan, Francis Castanie:
Effect of interleaving on a Markov channel. ICASSP 2000: 2661-2664 - [c1]Nadjia Kara, Jean Conan, André Girard:
Performance Evaluation of the Hierarchical Handoff Scheme for Wireless ATM Networks. MMNS 2000: 3-15
1990 – 1999
- 1997
- [j10]Jean Conan:
On the Enumeration and Generation of Nonweight Equivalent Rate ½ Convolutional Codes. Des. Codes Cryptogr. 10(1): 17-27 (1997) - 1993
- [j9]Jean Conan, Gérald E. Séguin:
Structural Properties and Enumeration of Quasi Cyclic Codes. Appl. Algebra Eng. Commun. Comput. 4: 25-39 (1993)
1980 – 1989
- 1989
- [j8]Brian Bryden, Gérald E. Séguin, Jean Conan, Vijay K. Bhargava, Andre Brind'amour:
Error correction/masking for digital voice transmission over the land mobile satellite system. IEEE Trans. Commun. 37(3): 309-314 (1989) - 1987
- [j7]Mansour Loeloeian, Jean Conan:
A transform approach to Goppa codes. IEEE Trans. Inf. Theory 33(1): 105-115 (1987) - 1985
- [j6]Jean Conan:
Correction to "The Weight Spectra of Some Short Low Rate Convolutional Codes". IEEE Trans. Commun. 33(6): 570 (1985) - 1984
- [j5]Jean Conan:
The Weight Spectra of Some Short Low-Rate Convolutional Codes. IEEE Trans. Commun. 32(9): 1050-1053 (1984) - [j4]Jean Conan:
On the distance properties of Paaske's class of rates 2/3 and 3/4 convolutional codes. IEEE Trans. Inf. Theory 30(1): 100-104 (1984) - [j3]Mansour Loeloeian, Jean Conan:
A [55, 16, 19] binary Goppa code. IEEE Trans. Inf. Theory 30(5): 773- (1984) - 1983
- [j2]Jean Conan:
An F8 Microprocessor-Based Breadboard for the Simulation of Communication Links Using Rate 1/2 Convolutional Codes and Viterbi Decoding. IEEE Trans. Commun. 31(2): 165-171 (1983) - 1982
- [j1]Jean Conan:
Structural properties of convolutional codes: An algorithmic approach with application to linear multivariable system theory (Ph.D. Thesis abstr.). IEEE Trans. Inf. Theory 28(2): 393 (1982)
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 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
