Philippe Piret Addendum to ``Generalized Permutations in Convolutional Codes'' [Citation Graph (0, 0)][DBLP] Information and Control, 1979, v:40, n:3, pp:332-334 [Journal]
Claude Le Dantec, Philippe Piret An encoder to match Reed-Solomon codes over GF(q) to a subalphabet of GF(q). [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1999, v:45, n:5, pp:1697-1701 [Journal]
Philippe Delsarte, Philippe Piret Correction to 'Bounds and constructions for binary asymmetric error-correcting codes' (Jan 81 125-128). [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1990, v:36, n:4, pp:954-0 [Journal]
Philippe Piret Comma free error correcting codes of variable length, generated by finite-state encoders. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1982, v:28, n:5, pp:764-774 [Journal]
Philippe Piret Multiple-word correcting convolutional codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1984, v:30, n:4, pp:637-643 [Journal]
Philippe Piret Binary codes for compound channels. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1985, v:31, n:3, pp:436-0 [Journal]
Philippe Piret An upper bound on the weight distribution of some systematic codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1985, v:31, n:4, pp:520-0 [Journal]
Philippe Piret Bounds for codes over the unit circle. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1986, v:32, n:6, pp:760-767 [Journal]
Philippe Piret Two results on the permuting mailbox channel. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1989, v:35, n:4, pp:888-0 [Journal]
Philippe Piret Analysis of a modified Hebbian rule. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1391-1397 [Journal]
Philippe Piret On the connectivity of radio networks. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:5, pp:1490-0 [Journal]
Philippe Piret Algebraic construction of cyclic codes over Z8 with a good Euclidean minimum distance. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1995, v:41, n:3, pp:815-818 [Journal]