default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGérald E. Séguin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2004
[j21]Gérald E. Séguin:
A Class of 1-Generator Quasi-Cyclic Codes. IEEE Trans. Inf. Theory 50(8): 1745-1753 (2004)
1990 – 1999
- 1998
- [j20]Gérald E. Séguin:
A Lower Bound on the Error Probability for Signals in White Gaussian Noise. IEEE Trans. Inf. Theory 44(7): 3168-3175 (1998) - 1995
- [j19]Gérald E. Séguin:
The q-ary image of a qm-ary cyclic code. IEEE Trans. Inf. Theory 41(2): 387-399 (1995) - [c1]Gérald E. Séguin:
The Algebraic Structure of Codes Invariant Under a Permutation. Information Theory and Applications 1995: 1-18 - 1994
- [j18]Gérald E. Séguin:
A Counter-Example to a Recent Result on the q-ary Image of a qs-ary Cyclic Code. Des. Codes Cryptogr. 4(2): 171-175 (1994) - [j17]Gérald E. Séguin:
A random coding bound for fixed convolutional codes of rate $l/n$. IEEE Trans. Inf. Theory 40(5): 1668-1670 (1994) - 1993
- [j16]Jean Conan, Gérald E. Séguin:
Structural Properties and Enumeration of Quasi Cyclic Codes. Appl. Algebra Eng. Commun. Comput. 4: 25-39 (1993) - 1990
- [j15]Gérald E. Séguin:
Low complexity normal bases for F2mn. Discret. Appl. Math. 28(3): 309-312 (1990) - [j14]Gérald E. Séguin, Germain Drolet:
The trace description of irreducible quasi-cyclic codes. IEEE Trans. Inf. Theory 36(6): 1463-1466 (1990)
1980 – 1989
- 1989
- [j13]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) - 1986
- [j12]Gérald E. Séguin:
Optimal symbol error rate encoding. IEEE Trans. Inf. Theory 32(2): 319- (1986) - 1985
- [j11]Gérald E. Séguin, Paul E. Allard, Vijay K. Bhargava:
A triple error-correcting product code for byte-oriented information systems. Proc. IEEE 73(11): 1683-1684 (1985) - 1984
- [j10]J. F. Huang, Saligram G. S. Shiva, Gérald E. Séguin:
On certain projective geometry codes. IEEE Trans. Inf. Theory 30(2): 385-388 (1984) - 1983
- [j9]Gérald E. Séguin, Paul E. Allard, Vijay K. Bhargava:
A Class of High Rate Codes for Byte-Oriented Information Systems. IEEE Trans. Commun. 31(3): 334-342 (1983) - [j8]Gérald E. Séguin:
On a class of convolutional codes. IEEE Trans. Inf. Theory 29(2): 215-223 (1983) - 1981
- [j7]Saligram G. S. Shiva, Paul E. Allard, Gérald E. Séguin:
A class of composite codes. IEEE Trans. Inf. Theory 27(2): 260-262 (1981)
1970 – 1979
- 1979
- [j6]Gérald E. Séguin:
Linear ensembles of codes (Corresp.). IEEE Trans. Inf. Theory 25(4): 477-480 (1979) - 1978
- [j5]Vijay K. Bhargava, Gérald E. Séguin, Jack M. Stein:
Some (ink, k) cyclic codes in quasi-cyclic form (Corresp.). IEEE Trans. Inf. Theory 24(5): 630-632 (1978) - 1975
- [j4]Gérald E. Séguin:
On synchronizable binary cyclic codes (Corresp.). IEEE Trans. Inf. Theory 21(5): 589-592 (1975) - 1973
- [j3]Gérald E. Séguin:
Bounds for Certain Cyclic AN-Codes. Inf. Control. 23(1): 41-47 (1973) - 1970
- [j2]Saligram G. S. Shiva, Gérald E. Séguin:
Synchronizable error-correcting binary codes (Corresp.). IEEE Trans. Inf. Theory 16(2): 241-242 (1970) - [j1]Gérald E. Séguin:
On the weight distribution of cyclic codes (Corresp.). IEEE Trans. Inf. Theory 16(3): 358 (1970)
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 2025-01-09 13:16 CET 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:
