Some optimal type B1 convolutional codes (Corresp.). - Philippe Piret (IEEE Trans. Inf. Theory, 1971)

A stochastic model for burst-correcting convolutional decoders (Corresp.). - Philippe Piret (IEEE Trans. Inf. Theory, 1972)

On a class of alternating cyclic convolutional codes. - Philippe Piret (IEEE Trans. Inf. Theory, 1975)

Structure and constructions of cyclic convolutional codes. - Philippe Piret (IEEE Trans. Inf. Theory, 1976)

Some optimal AMC codes (Corresp.). - Philippe Piret (IEEE Trans. Inf. Theory, 1976)

Semiregular Convolutional Codes: Definition, Structure, and Examples - Philippe Delsarte; Philippe Piret (Inf. Control., 1977)

Generalized Permutations in Convolutional Codes - Philippe Piret (Inf. Control., 1978)

Causal sliding block encoders with feedback (Corresp.). - Philippe Piret (IEEE Trans. Inf. Theory, 1979)

Sliding block implementation of block codes (Corresp.). - Philippe Piret (IEEE Trans. Inf. Theory, 1979)

Addendum to "Generalized Permutations in Convolutional Codes" - Philippe Piret (Inf. Control., 1979)

On the (23, 14, 5) Wagner code (Corresp.). - Andries E. Brouwer; Philippe Delsarte; Philippe Piret (IEEE Trans. Inf. Theory, 1980)

Combinatorial properties of good codes for binary autoregressive sources (Corresp.). - Philippe Delsarte; Philippe Piret (IEEE Trans. Inf. Theory, 1980)

Good linear codes of length 27 and 28 (Corresp.). - Philippe Piret (IEEE Trans. Inf. Theory, 1980)

Basic encoders for Abelian convolutional codes. - Philippe Piret (IEEE Trans. Inf. Theory, 1980)

Bounds and constructions for binary asymmetric error-correcting codes. - Philippe Delsarte; Philippe Piret (IEEE Trans. Inf. Theory, 1981)

Spectral Enumerators for Certain Additive-Error-Correcting Codes over Integer Alphabets - Philippe Delsarte; Philippe Piret (Inf. Control., 1981)

Algebraic constructions of Shannon codes for regular channels. - Philippe Delsarte; Philippe Piret (IEEE Trans. Inf. Theory, 1982)

Comma free error correcting codes of variable length, generated by finite-state encoders. - Philippe Piret (IEEE Trans. Inf. Theory, 1982)

Analytical Characteristics of the DES. - Marc Davio; Yvo Desmedt; Marc Fosseprez; René Govaerts; Jan Hulsbosch; Patrik Neutjens; Philippe Piret; Jean-Jacques Quisquater; Joos Vandewalle; Pascal Wouters (CRYPTO, 1983)

MDS convolutional codes. - Philippe Piret; Thijs Krol (IEEE Trans. Inf. Theory, 1983)

On the number of divisors of a polynomial over GF(2). - Philippe Piret (AAECC, 1984)

Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme. - Philippe Delsarte; Yvo Desmedt; Andrew M. Odlyzko; Philippe Piret (EUROCRYPT, 1984)

Multiple-word correcting convolutional codes. - Philippe Piret (IEEE Trans. Inf. Theory, 1984)

An extension of an inequality by Ahlswede, El Gamal and pang for pairs of binary codes. - Philippe Delsarte; Philippe Piret (Discret. Math., 1985)

Word correction by means of convolutional codes. - Philippe Piret (Discret. Math., 1985)

Binary codes for compound channels. - Philippe Piret (IEEE Trans. Inf. Theory, 1985)

An upper bound on the weight distribution of some systematic codes. - Philippe Piret (IEEE Trans. Inf. Theory, 1985)

Do most binary linear codes achieve the Goblick bound on the covering radius? - Philippe Delsarte; Philippe Piret (IEEE Trans. Inf. Theory, 1986)

Bounds for codes over the unit circle. - Philippe Piret (IEEE Trans. Inf. Theory, 1986)

A Conjecture on the Free Distance of (2, 1m) Binary Convolutional Codes. - Philippe Piret (AAECC, 1987)

Bounds on the use of the postal channel. - Philippe Piret (Coding Theory and Applications, 1988)

Two results on the permuting mailbox channel. - Philippe Piret (IEEE Trans. Inf. Theory, 1989)

Correction to 'Bounds and constructions for binary asymmetric error-correcting codes' (Jan 81 125-128). - Philippe Delsarte; Philippe Piret (IEEE Trans. Inf. Theory, 1990)

Analysis of a modified Hebbian rule. - Philippe Piret (IEEE Trans. Inf. Theory, 1990)

On the connectivity of radio networks. - Philippe Piret (IEEE Trans. Inf. Theory, 1991)

Algebraic construction of cyclic codes over Z8 with a good Euclidean minimum distance. - Philippe Piret (IEEE Trans. Inf. Theory, 1995)

An encoder to match Reed-Solomon codes over GF(q) to a subalphabet of GF(q). - Claude Le Dantec; Philippe Piret (IEEE Trans. Inf. Theory, 1999)

Permutations preserving divisibility. - Robert J. McEliece; Claude Le Dantec; Philippe Piret (IEEE Trans. Inf. Theory, 2001)

Bolt interleavers for turbo codes. - P. Le Bars; Claude Le Dantec; Philippe Piret (IEEE Trans. Inf. Theory, 2003)

Aggregate error locator and error value computation in AG codes. - P. Le Bars; Philippe Piret (J. Comb. Theory A, 2006)

Correction to "Bolt Interleavers for Turbo Codes". - P. Le Bars; Claude Le Dantec; Philippe Piret (IEEE Trans. Inf. Theory, 2006)