Philippe Delsarte

According to our database1, Philippe Delsarte authored at least 50 papers between 1968 and 2006.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2006
On the optimal scheduling of periodic tests and maintenance for reliable redundant components.
Reliab. Eng. Syst. Saf., 2006

2004
Beyond the orthogonal array concept.
Eur. J. Comb., 2004

1998
Association Schemes and Coding Theory.
IEEE Trans. Information Theory, 1998

1993
On Error-Correcting Codes and Invariant Linear Forms.
SIAM J. Discrete Math., 1993

1992
Signal-adapted multiresolution transform for image coding.
IEEE Trans. Information Theory, 1992

On a generalization of the Szegö-Levinson recurrence and its application in lossless inverse scattering.
IEEE Trans. Information Theory, 1992

1991
A strengthening of the Assmus-Mattson theorem.
IEEE Trans. Information Theory, 1991

On r-Partition Designs in Hamming Spaces.
Appl. Algebra Eng. Commun. Comput., 1991

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

1989
An extension of the split Levinson algorithm and its relatives to the joint process estimation problem.
IEEE Trans. Information Theory, 1989

Low Rank Matrices with a Given Sign Pattern.
SIAM J. Discrete Math., 1989

Interpolation type problems in the class of positive trigonometric polynomials of fixed order.
MCSS, 1989

1988
Some Bounds for the Distribution Numbers of an Association Scheme.
Eur. J. Comb., 1988

1987
Zero location of lacunary prediction polynomials.
IEEE Trans. Acoustics, Speech, and Signal Processing, 1987

On the splitting of classical algorithms in linear prediction theory.
IEEE Trans. Acoustics, Speech, and Signal Processing, 1987

Stability of linear predictors and numerical range of a linear operator.
IEEE Trans. Information Theory, 1987

1986
The split Levinson algorithm.
IEEE Trans. Acoustics, Speech, and Signal Processing, 1986

Do most binary linear codes achieve the Goblick bound on the covering radius?
IEEE Trans. Information Theory, 1986

1985
A generalization of the Levinson algorithm for Hermitian Toeplitz matrices with any rank profile.
IEEE Trans. Acoustics, Speech, and Signal Processing, 1985

Positive-definite Toeplitz embedding based on the cyclic extension of a data matrix.
IEEE Trans. Acoustics, Speech, and Signal Processing, 1985

An extension of an inequality by Ahlswede, El Gamal and pang for pairs of binary codes.
Discret. Math., 1985

1984
Relationship between the Karhunen-Loéve transform and the Courant-Fischer theorem.
IEEE Trans. Information Theory, 1984

An Addition Formula for Hyperbolic Space.
J. Comb. Theory, Ser. A, 1984

Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme.
Proceedings of the Advances in Cryptology: Proceedings of EUROCRYPT 84, 1984

1983
A polynomial approach to the generalized Levinson algorithm based on the Toeplitz distance.
IEEE Trans. Information Theory, 1983

On the role of the partial trigonometric moment problem in AR speech modelling.
Proceedings of the IEEE International Conference on Acoustics, 1983

1982
Algebraic constructions of Shannon codes for regular channels.
IEEE Trans. Information Theory, 1982

On the mathematical foundations of the generalized Levinson algorithm.
Proceedings of the IEEE International Conference on Acoustics, 1982

1981
Spectral Enumerators for Certain Additive-Error-Correcting Codes over Integer Alphabets
Information and Control, March, 1981

Bounds and constructions for binary asymmetric error-correcting codes.
IEEE Trans. Information Theory, 1981

1980
Combinatorial properties of good codes for binary autoregressive sources (Corresp.).
IEEE Trans. Information Theory, 1980

Half-plane Toeplitz systems.
IEEE Trans. Information Theory, 1980

On the (23, 14, 5) Wagner code (Corresp.).
IEEE Trans. Information Theory, 1980

Planar Least-Squares Inverse Polynomials. Part II: Asymptotic Behavior.
SIAM J. Matrix Analysis Applications, 1980

1979
A generalization of the Legendre symbol for finite Abelian groups.
Discret. Math., 1979

1978
Partial-optimal piecewise decoding of linear codes.
IEEE Trans. Information Theory, 1978

Bilinear Forms over a Finite Field, with Applications to Coding Theory.
J. Comb. Theory, Ser. A, 1978

1977
Semiregular Convolutional Codes: Definition, Structure, and Examples
Information and Control, January, 1977

1976
Association Schemes and t-Designs in Regular Semilattices.
J. Comb. Theory, Ser. A, 1976

1975
On subfield subcodes of modified Reed-Solomon codes (Corresp.).
IEEE Trans. Information Theory, 1975

Alternating Bilinear Forms over GF(q).
J. Comb. Theory, Ser. A, 1975

Unrestricted codes with the golay parameters are unique.
Discret. Math., 1975

1973
Four Fundamental Parameters of a Code and Their Combinatorial Significance
Information and Control, December, 1973

Permutation Cascades with Normalized Cells
Information and Control, November, 1973

1972
Weights of linear codes and strongly regular normed spaces.
Discret. Math., 1972

1971
Majority Logic Decodable Codes Derived from Finite Inversive Planes
Information and Control, May, 1971

1970
On Generalized Reed-Muller Codes and Their Relatives
Information and Control, July, 1970

On cyclic codes that are invariant under the general linear group.
IEEE Trans. Information Theory, 1970

1969
Tri-weight Codes and Generalized Hadamard Matrices
Information and Control, August, 1969

1968
On a class of majority-logic decodable cyclic codes.
IEEE Trans. Information Theory, 1968


  Loading...