default search action
Philippe Piret
Person information
SPARQL queries
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
- [j36]P. Le Bars, Philippe Piret:
Aggregate error locator and error value computation in AG codes. J. Comb. Theory A 113(8): 1771-1782 (2006) - [j35]P. Le Bars, Claude Le Dantec, Philippe Piret:
Correction to "Bolt Interleavers for Turbo Codes". IEEE Trans. Inf. Theory 52(8): 3856 (2006) - 2003
- [j34]P. Le Bars, Claude Le Dantec, Philippe Piret:
Bolt interleavers for turbo codes. IEEE Trans. Inf. Theory 49(2): 391-400 (2003) - 2001
- [j33]Robert J. McEliece, Claude Le Dantec, Philippe Piret:
Permutations preserving divisibility. IEEE Trans. Inf. Theory 47(3): 1206-1207 (2001)
1990 – 1999
- 1999
- [j32]Claude Le Dantec, Philippe Piret:
An encoder to match Reed-Solomon codes over GF(q) to a subalphabet of GF(q). IEEE Trans. Inf. Theory 45(5): 1697-1701 (1999) - 1995
- [j31]Philippe Piret:
Algebraic construction of cyclic codes over Z8 with a good Euclidean minimum distance. IEEE Trans. Inf. Theory 41(3): 815-818 (1995) - 1991
- [j30]Philippe Piret:
On the connectivity of radio networks. IEEE Trans. Inf. Theory 37(5): 1490-1492 (1991) - 1990
- [j29]Philippe Delsarte, Philippe Piret:
Correction to 'Bounds and constructions for binary asymmetric error-correcting codes' (Jan 81 125-128). IEEE Trans. Inf. Theory 36(4): 954- (1990) - [j28]Philippe Piret:
Analysis of a modified Hebbian rule. IEEE Trans. Inf. Theory 36(6): 1391-1397 (1990)
1980 – 1989
- 1989
- [j27]Philippe Piret:
Two results on the permuting mailbox channel. IEEE Trans. Inf. Theory 35(4): 888-892 (1989) - 1988
- [c5]Philippe Piret:
Bounds on the use of the postal channel. Coding Theory and Applications 1988: 79-90 - 1987
- [c4]Philippe Piret:
A Conjecture on the Free Distance of (2, 1m) Binary Convolutional Codes. AAECC 1987: 369-375 - 1986
- [j26]Philippe Piret:
Bounds for codes over the unit circle. IEEE Trans. Inf. Theory 32(6): 760-767 (1986) - [j25]Philippe Delsarte, Philippe Piret:
Do most binary linear codes achieve the Goblick bound on the covering radius? IEEE Trans. Inf. Theory 32(6): 826-828 (1986) - 1985
- [j24]Philippe Delsarte, Philippe Piret:
An extension of an inequality by Ahlswede, El Gamal and pang for pairs of binary codes. Discret. Math. 55(3): 313-315 (1985) - [j23]Philippe Piret:
Word correction by means of convolutional codes. Discret. Math. 56(2-3): 239-243 (1985) - [j22]Philippe Piret:
Binary codes for compound channels. IEEE Trans. Inf. Theory 31(3): 436-440 (1985) - [j21]Philippe Piret:
An upper bound on the weight distribution of some systematic codes. IEEE Trans. Inf. Theory 31(4): 520-521 (1985) - 1984
- [j20]Philippe Piret:
Multiple-word correcting convolutional codes. IEEE Trans. Inf. Theory 30(4): 637-643 (1984) - [c3]Philippe Piret:
On the number of divisors of a polynomial over GF(2). AAECC 1984: 161-168 - [c2]Philippe Delsarte, Yvo Desmedt, Andrew M. Odlyzko, Philippe Piret:
Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme. EUROCRYPT 1984: 142-149 - 1983
- [j19]Philippe Piret, Thijs Krol:
MDS convolutional codes. IEEE Trans. Inf. Theory 29(2): 224-232 (1983) - [c1]Marc Davio, Yvo Desmedt, Marc Fosseprez, René Govaerts, Jan Hulsbosch, Patrik Neutjens, Philippe Piret, Jean-Jacques Quisquater, Joos Vandewalle, Pascal Wouters:
Analytical Characteristics of the DES. CRYPTO 1983: 171-202 - 1982
- [j18]Philippe Delsarte, Philippe Piret:
Algebraic constructions of Shannon codes for regular channels. IEEE Trans. Inf. Theory 28(4): 593-599 (1982) - [j17]Philippe Piret:
Comma free error correcting codes of variable length, generated by finite-state encoders. IEEE Trans. Inf. Theory 28(5): 764-774 (1982) - 1981
- [j16]Philippe Delsarte, Philippe Piret:
Spectral Enumerators for Certain Additive-Error-Correcting Codes over Integer Alphabets. Inf. Control. 48(3): 193-210 (1981) - [j15]Philippe Delsarte, Philippe Piret:
Bounds and constructions for binary asymmetric error-correcting codes. IEEE Trans. Inf. Theory 27(1): 125-128 (1981) - 1980
- [j14]Philippe Piret:
Good linear codes of length 27 and 28 (Corresp.). IEEE Trans. Inf. Theory 26(2): 227 (1980) - [j13]Philippe Delsarte, Philippe Piret:
Combinatorial properties of good codes for binary autoregressive sources (Corresp.). IEEE Trans. Inf. Theory 26(3): 341-345 (1980) - [j12]Philippe Piret:
Basic encoders for Abelian convolutional codes. IEEE Trans. Inf. Theory 26(5): 534-539 (1980) - [j11]Andries E. Brouwer, Philippe Delsarte, Philippe Piret:
On the (23, 14, 5) Wagner code (Corresp.). IEEE Trans. Inf. Theory 26(6): 742-743 (1980)
1970 – 1979
- 1979
- [j10]Philippe Piret:
Addendum to "Generalized Permutations in Convolutional Codes". Inf. Control. 40(3): 332-334 (1979) - [j9]Philippe Piret:
Causal sliding block encoders with feedback (Corresp.). IEEE Trans. Inf. Theory 25(2): 237-240 (1979) - [j8]Philippe Piret:
Sliding block implementation of block codes (Corresp.). IEEE Trans. Inf. Theory 25(6): 725-728 (1979) - 1978
- [j7]Philippe Piret:
Generalized Permutations in Convolutional Codes. Inf. Control. 38(2): 213-239 (1978) - 1977
- [j6]Philippe Delsarte, Philippe Piret:
Semiregular Convolutional Codes: Definition, Structure, and Examples. Inf. Control. 33(1): 56-71 (1977) - 1976
- [j5]Philippe Piret:
Structure and constructions of cyclic convolutional codes. IEEE Trans. Inf. Theory 22(2): 147-155 (1976) - [j4]Philippe Piret:
Some optimal AMC codes (Corresp.). IEEE Trans. Inf. Theory 22(2): 247-248 (1976) - 1975
- [j3]Philippe Piret:
On a class of alternating cyclic convolutional codes. IEEE Trans. Inf. Theory 21(1): 64-69 (1975) - 1972
- [j2]Philippe Piret:
A stochastic model for burst-correcting convolutional decoders (Corresp.). IEEE Trans. Inf. Theory 18(4): 532-535 (1972) - 1971
- [j1]Philippe Piret:
Some optimal type B1 convolutional codes (Corresp.). IEEE Trans. Inf. Theory 17(3): 355-356 (1971)
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-06-10 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint