default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhilippe Delsarte
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[j47]Pierre-Jacques Courtois, Philippe Delsarte:
On the optimal scheduling of periodic tests and maintenance for reliable redundant components. Reliab. Eng. Syst. Saf. 91(1): 66-72 (2006)- 2004
- [j46]Philippe Delsarte:
Beyond the orthogonal array concept. Eur. J. Comb. 25(2): 187-198 (2004)
1990 – 1999
- 1998
- [j45]Philippe Delsarte, Vladimir I. Levenshtein:
Association Schemes and Coding Theory. IEEE Trans. Inf. Theory 44(6): 2477-2504 (1998) - 1993
- [j44]A. Robert Calderbank, Philippe Delsarte:
On Error-Correcting Codes and Invariant Linear Forms. SIAM J. Discret. Math. 6(1): 1-23 (1993) - 1992
- [j43]Philippe Delsarte, Yves V. Genin:
On a generalization of the Szegö-Levinson recurrence and its application in lossless inverse scattering. IEEE Trans. Inf. Theory 38(1): 104-110 (1992) - [j42]Philippe Delsarte, Benoît Macq, Dirk T. M. Slock:
Signal-adapted multiresolution transform for image coding. IEEE Trans. Inf. Theory 38(2): 897-904 (1992) - 1991
- [j41]Paul Camion, Bernard Courteau, Philippe Delsarte:
On r-Partition Designs in Hamming Spaces. Appl. Algebra Eng. Commun. Comput. 2: 147-162 (1991) - [j40]A. Robert Calderbank, Philippe Delsarte, Neil J. A. Sloane:
A strengthening of the Assmus-Mattson theorem. IEEE Trans. Inf. Theory 37(5): 1261-1268 (1991) - [c5]Philippe Delsarte, Benoît Macq, Dirk T. M. Slock:
Efficient multiresolution signal coding via a signal-adapted perfect reconstruction filter pyramid. ICASSP 1991: 2633-2636 - 1990
- [j39]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)
1980 – 1989
- 1989
- [j38]Philippe Delsarte, Yves V. Genin, Yves G. Kamp:
Interpolation type problems in the class of positive trigonometric polynomials of fixed order. Math. Control. Signals Syst. 2(2): 171-185 (1989) - [j37]Philippe Delsarte, Yves G. Kamp:
Low Rank Matrices with a Given Sign Pattern. SIAM J. Discret. Math. 2(1): 51-63 (1989) - [j36]Philippe Delsarte, Yves V. Genin:
An extension of the split Levinson algorithm and its relatives to the joint process estimation problem. IEEE Trans. Inf. Theory 35(2): 482-485 (1989) - 1988
- [j35]Thomas Bier, Philippe Delsarte:
Some Bounds for the Distribution Numbers of an Association Scheme. Eur. J. Comb. 9(1): 1-5 (1988) - 1987
- [j34]Philippe Delsarte, Yves V. Genin, Yves G. Kamp:
Stability of linear predictors and numerical range of a linear operator. IEEE Trans. Inf. Theory 33(3): 412-415 (1987) - [j33]Philippe Delsarte, Yves V. Genin:
On the splitting of classical algorithms in linear prediction theory. IEEE Trans. Acoust. Speech Signal Process. 35(5): 645-653 (1987) - [j32]Philippe Delsarte, Yves V. Genin, Yves G. Kamp:
Zero location of lacunary prediction polynomials. IEEE Trans. Acoust. Speech Signal Process. 35(9): 1346-1347 (1987) - 1986
- [j31]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) - [j30]Philippe Delsarte, Yves V. Genin:
The split Levinson algorithm. IEEE Trans. Acoust. Speech Signal Process. 34(3): 470-478 (1986) - [c4]Philippe Delsarte, Yves V. Genin, Yves G. Kamp:
Stability margins of linear prediction polynomials. ICASSP 1986: 3003-3005 - 1985
- [j29]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) - [j28]Philippe Delsarte, Yves V. Genin, Yves G. Kamp:
Positive-definite Toeplitz embedding based on the cyclic extension of a data matrix. IEEE Trans. Acoust. Speech Signal Process. 33(2): 393-400 (1985) - [j27]Philippe Delsarte, Yves V. Genin, Yves G. Kamp:
A generalization of the Levinson algorithm for Hermitian Toeplitz matrices with any rank profile. IEEE Trans. Acoust. Speech Signal Process. 33(4): 964-971 (1985) - 1984
- [j26]Eiichi Bannai, Aart Blokhuis, J. J. Seidel, Philippe Delsarte:
An Addition Formula for Hyperbolic Space. J. Comb. Theory A 36(3): 332-341 (1984) - [j25]Philippe Delsarte, Yves G. Kamp:
Relationship between the Karhunen-Loéve transform and the Courant-Fischer theorem. IEEE Trans. Inf. Theory 30(4): 662-664 (1984) - [c3]Philippe Delsarte, Yvo Desmedt, Andrew M. Odlyzko, Philippe Piret:
Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme. EUROCRYPT 1984: 142-149 - 1983
- [j24]Philippe Delsarte, Yves V. Genin, Yves G. Kamp:
A polynomial approach to the generalized Levinson algorithm based on the Toeplitz distance. IEEE Trans. Inf. Theory 29(2): 268-278 (1983) - [c2]Philippe Delsarte, Yves V. Genin, Yves G. Kamp, Paul Van Dooren:
On the role of the partial trigonometric moment problem in AR speech modelling. ICASSP 1983: 789-792 - 1982
- [j23]Philippe Delsarte, Philippe Piret:
Algebraic constructions of Shannon codes for regular channels. IEEE Trans. Inf. Theory 28(4): 593-599 (1982) - [c1]Philippe Delsarte, Yves V. Genin, Yves G. Kamp:
On the mathematical foundations of the generalized Levinson algorithm. ICASSP 1982: 1717-1720 - 1981
- [j22]Philippe Delsarte, Philippe Piret:
Spectral Enumerators for Certain Additive-Error-Correcting Codes over Integer Alphabets. Inf. Control. 48(3): 193-210 (1981) - [j21]Philippe Delsarte, Philippe Piret:
Bounds and constructions for binary asymmetric error-correcting codes. IEEE Trans. Inf. Theory 27(1): 125-128 (1981) - 1980
- [j20]Philippe Delsarte, Yves V. Genin, Yves G. Kamp:
Planar Least-Squares Inverse Polynomials. Part II: Asymptotic Behavior. SIAM J. Algebraic Discret. Methods 1(3): 336-344 (1980) - [j19]Philippe Delsarte, Philippe Piret:
Combinatorial properties of good codes for binary autoregressive sources (Corresp.). IEEE Trans. Inf. Theory 26(3): 341-345 (1980) - [j18]Philippe Delsarte, Yves V. Genin, Yves G. Kamp:
Half-plane Toeplitz systems. IEEE Trans. Inf. Theory 26(4): 465-474 (1980) - [j17]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
- [j16]Philippe Delsarte:
A generalization of the Legendre symbol for finite Abelian groups. Discret. Math. 27(2): 187-192 (1979) - 1978
- [j15]Philippe Delsarte:
Bilinear Forms over a Finite Field, with Applications to Coding Theory. J. Comb. Theory A 25(3): 226-241 (1978) - [j14]Philippe Delsarte:
Partial-optimal piecewise decoding of linear codes. IEEE Trans. Inf. Theory 24(1): 70-75 (1978) - 1977
- [j13]Philippe Delsarte, Philippe Piret:
Semiregular Convolutional Codes: Definition, Structure, and Examples. Inf. Control. 33(1): 56-71 (1977) - 1976
- [j12]Philippe Delsarte:
Association Schemes and t-Designs in Regular Semilattices. J. Comb. Theory A 20(2): 230-243 (1976) - 1975
- [j11]Philippe Delsarte, Jean-Marie Goethals:
Unrestricted codes with the golay parameters are unique. Discret. Math. 12(3): 211-224 (1975) - [j10]Philippe Delsarte, Jean-Marie Goethals:
Alternating Bilinear Forms over GF(q). J. Comb. Theory A 19(1): 26-50 (1975) - [j9]Philippe Delsarte:
On subfield subcodes of modified Reed-Solomon codes (Corresp.). IEEE Trans. Inf. Theory 21(5): 575-576 (1975) - 1973
- [j8]Philippe Delsarte, Jean-Jacques Quisquater:
Permutation Cascades with Normalized Cells. Inf. Control. 23(4): 344-356 (1973) - [j7]Philippe Delsarte:
Four Fundamental Parameters of a Code and Their Combinatorial Significance. Inf. Control. 23(5): 407-438 (1973) - 1972
- [j6]Philippe Delsarte:
Weights of linear codes and strongly regular normed spaces. Discret. Math. 3(1-3): 47-64 (1972) - 1971
- [j5]Philippe Delsarte:
Majority Logic Decodable Codes Derived from Finite Inversive Planes. Inf. Control. 18(4): 319-325 (1971) - 1970
- [j4]Philippe Delsarte, Jean-Marie Goethals, F. Jessie MacWilliams:
On Generalized Reed-Muller Codes and Their Relatives. Inf. Control. 16(5): 403-442 (1970) - [j3]Philippe Delsarte:
On cyclic codes that are invariant under the general linear group. IEEE Trans. Inf. Theory 16(6): 760-769 (1970)
1960 – 1969
- 1969
- [j2]Philippe Delsarte, Jean-Marie Goethals:
Tri-weight Codes and Generalized Hadamard Matrices. Inf. Control. 15(2): 196-206 (1969) - 1968
- [j1]Jean-Marie Goethals, Philippe Delsarte:
On a class of majority-logic decodable cyclic codes. IEEE Trans. Inf. Theory 14(2): 182-188 (1968)
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 21:26 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:
