Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
117 | Stacy Marsella, Sharon Marie Carnicke, Jonathan Gratch, Anna Okhmatovskaia, Albert A. Rizzo |
An Exploration of Delsarte's Structural Acting System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IVA ![In: Intelligent Virtual Agents, 6th International Conference, IVA 2006, Marina Del Rey, CA, USA, August 21-23, 2006, Proceedings, pp. 80-92, 2006, Springer, 3-540-37593-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Acting Technique, Delsarte, Virtual Human, Nonverbal Behavior |
85 | Svetla Nikova, Ventzislav Nikov |
Improvement of the Delsarte Bound for tau-Designs in Finite Polynomial Metric Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMACC ![In: Cryptography and Coding, 8th IMA International Conference, Cirencester, UK, December 17-19, 2001, Proceedings, pp. 191-204, 2001, Springer, 3-540-43026-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
60 | Mario Szegedy |
A note on the Theta number of Lovász and the generalized Delsarte bound ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 36-39, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
semidefinite, /spl theta/ number, generalized Delsarte bound, convex programming upper bounds, programming upper bounds, convex programming |
46 | Michael Navon, Alex Samorodnitsky |
On Delsarte's Linear Programming Bounds for Binary Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings, pp. 327-338, 2005, IEEE Computer Society, 0-7695-2468-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
38 | Sergey V. Avgustinovich, Ivan Yu. Mogilnykh |
Perfect 2-Colorings of Johnson Graphs J(6, 3) and J(7, 3). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICMCTA ![In: Coding Theory and Applications, Second International Castle Meeting, ICMCTA 2008, Castillo de la Mota, Medina del Campo, Spain, September 15-19, 2008. Proceedings, pp. 11-19, 2008, Springer, 978-3-540-87447-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
38 | Alexander Schrijver |
New code upper bounds from the Terwilliger algebra and semidefinite programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 51(8), pp. 2859-2866, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
38 | Masaaki Harada, Michio Ozeki, Kenichiro Tanabe |
On the Covering Radius of Ternary Extremal Self-Dual Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 33(2), pp. 149-158, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
ternary code, covering radius, self-dual code |
38 | Dong-Joon Shin, P. Vijay Kumar, Tor Helleseth |
An Assmus-Mattson-Type Approach for Identifying 3-Designs from Linear Codes over Z4. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 31(1), pp. 75-92, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Z 4 codes, Assmus-Mattson, complete weight enumerator, t-designs |
33 | Pierre-Jacques Courtois, Philippe Delsarte |
On the optimal scheduling of periodic tests and maintenance for reliable redundant components. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Reliab. Eng. Syst. Saf. ![In: Reliab. Eng. Syst. Saf. 91(1), pp. 66-72, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte |
Beyond the orthogonal array concept. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 25(2), pp. 187-198, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Vladimir I. Levenshtein |
Association Schemes and Coding Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 44(6), pp. 2477-2504, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
33 | A. Robert Calderbank, Philippe Delsarte |
On Error-Correcting Codes and Invariant Linear Forms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 6(1), pp. 1-23, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Yves V. Genin |
On a generalization of the Szegö-Levinson recurrence and its application in lossless inverse scattering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 38(1), pp. 104-110, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Benoît Macq, Dirk T. M. Slock |
Signal-adapted multiresolution transform for image coding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 38(2), pp. 897-904, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
33 | Paul Camion, Bernard Courteau, Philippe Delsarte |
On r-Partition Designs in Hamming Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 2, pp. 147-162, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
33 | A. Robert Calderbank, Philippe Delsarte, Neil J. A. Sloane |
A strengthening of the Assmus-Mattson theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 37(5), pp. 1261-1268, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Benoît Macq, Dirk T. M. Slock |
Efficient multiresolution signal coding via a signal-adapted perfect reconstruction filter pyramid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICASSP ![In: 1991 International Conference on Acoustics, Speech, and Signal Processing, ICASSP '91, Toronto, Ontario, Canada, May 14-17, 1991, pp. 2633-2636, 1991, IEEE Computer Society, 0-7803-0003-3. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Philippe Piret |
Correction to 'Bounds and constructions for binary asymmetric error-correcting codes' (Jan 81 125-128). ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 36(4), pp. 954-, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP BibTeX RDF |
|
33 | Philippe Delsarte, Yves V. Genin, Yves G. Kamp |
Interpolation type problems in the class of positive trigonometric polynomials of fixed order. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Control. Signals Syst. ![In: Math. Control. Signals Syst. 2(2), pp. 171-185, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Yves G. Kamp |
Low Rank Matrices with a Given Sign Pattern. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 2(1), pp. 51-63, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Yves V. Genin |
An extension of the split Levinson algorithm and its relatives to the joint process estimation problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 35(2), pp. 482-485, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
33 | Thomas Bier, Philippe Delsarte |
Some Bounds for the Distribution Numbers of an Association Scheme. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 9(1), pp. 1-5, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Yves V. Genin, Yves G. Kamp |
Stability of linear predictors and numerical range of a linear operator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 33(3), pp. 412-415, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Yves V. Genin |
On the splitting of classical algorithms in linear prediction theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Acoust. Speech Signal Process. ![In: IEEE Trans. Acoust. Speech Signal Process. 35(5), pp. 645-653, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Yves V. Genin, Yves G. Kamp |
Zero location of lacunary prediction polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Acoust. Speech Signal Process. ![In: IEEE Trans. Acoust. Speech Signal Process. 35(9), pp. 1346-1347, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Philippe Piret |
Do most binary linear codes achieve the Goblick bound on the covering radius? ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 32(6), pp. 826-828, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Yves V. Genin |
The split Levinson algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Acoust. Speech Signal Process. ![In: IEEE Trans. Acoust. Speech Signal Process. 34(3), pp. 470-478, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP BibTeX RDF |
|
33 | Philippe Delsarte, Yves V. Genin, Yves G. Kamp |
Stability margins of linear prediction polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICASSP ![In: IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 1986, Tokyo, Japan, April 7-11, 1986, pp. 3003-3005, 1986, IEEE. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Yves V. Genin, Yves G. Kamp |
A generalization of the Levinson algorithm for Hermitian Toeplitz matrices with any rank profile. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Acoust. Speech Signal Process. ![In: IEEE Trans. Acoust. Speech Signal Process. 33(4), pp. 964-971, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Yves V. Genin, Yves G. Kamp |
Positive-definite Toeplitz embedding based on the cyclic extension of a data matrix. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Acoust. Speech Signal Process. ![In: IEEE Trans. Acoust. Speech Signal Process. 33(2), pp. 393-400, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Philippe Piret |
An extension of an inequality by Ahlswede, El Gamal and pang for pairs of binary codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 55(3), pp. 313-315, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Yves G. Kamp |
Relationship between the Karhunen-Loéve transform and the Courant-Fischer theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 30(4), pp. 662-664, 1984. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
33 | Eiichi Bannai, Aart Blokhuis, J. J. Seidel, Philippe Delsarte |
An Addition Formula for Hyperbolic Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 36(3), pp. 332-341, 1984. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Yvo Desmedt, Andrew M. Odlyzko, Philippe Piret |
Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology: Proceedings of EUROCRYPT 84, A Workshop on the Theory and Application of of Cryptographic Techniques, Paris, France, April 9-11, 1984, Proceedings, pp. 142-149, 1984, Springer, 3-540-16076-0. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Yves V. Genin, Yves G. Kamp |
A polynomial approach to the generalized Levinson algorithm based on the Toeplitz distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 29(2), pp. 268-278, 1983. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Yves V. Genin, Yves G. Kamp, Paul Van Dooren |
On the role of the partial trigonometric moment problem in AR speech modelling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICASSP ![In: IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP '83, Boston, Massachusetts, USA, April 14-16, 1983, pp. 789-792, 1983, IEEE. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Philippe Piret |
Algebraic constructions of Shannon codes for regular channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 28(4), pp. 593-599, 1982. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Yves V. Genin, Yves G. Kamp |
On the mathematical foundations of the generalized Levinson algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICASSP ![In: IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP '82, Paris, France, May 3-5, 1982, pp. 1717-1720, 1982, IEEE. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Philippe Piret |
Bounds and constructions for binary asymmetric error-correcting codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 27(1), pp. 125-128, 1981. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Philippe Piret |
Spectral Enumerators for Certain Additive-Error-Correcting Codes over Integer Alphabets ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Control. ![In: Inf. Control. 48(3), pp. 193-210, March 1981. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Yves V. Genin, Yves G. Kamp |
Planar Least-Squares Inverse Polynomials. Part II: Asymptotic Behavior. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Algebraic Discret. Methods ![In: SIAM J. Algebraic Discret. Methods 1(3), pp. 336-344, 1980. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Yves V. Genin, Yves G. Kamp |
Half-plane Toeplitz systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 26(4), pp. 465-474, 1980. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
33 | Andries E. Brouwer, Philippe Delsarte, Philippe Piret |
On the (23, 14, 5) Wagner code (Corresp.). ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 26(6), pp. 742-743, 1980. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Philippe Piret |
Combinatorial properties of good codes for binary autoregressive sources (Corresp.). ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 26(3), pp. 341-345, 1980. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte |
A generalization of the Legendre symbol for finite Abelian groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 27(2), pp. 187-192, 1979. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte |
Partial-optimal piecewise decoding of linear codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 24(1), pp. 70-75, 1978. The full citation details ...](Pics/full.jpeg) |
1978 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte |
Bilinear Forms over a Finite Field, with Applications to Coding Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 25(3), pp. 226-241, 1978. The full citation details ...](Pics/full.jpeg) |
1978 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Philippe Piret |
Semiregular Convolutional Codes: Definition, Structure, and Examples ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Control. ![In: Inf. Control. 33(1), pp. 56-71, January 1977. The full citation details ...](Pics/full.jpeg) |
1977 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte |
Association Schemes and t-Designs in Regular Semilattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 20(2), pp. 230-243, 1976. The full citation details ...](Pics/full.jpeg) |
1976 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte |
On subfield subcodes of modified Reed-Solomon codes (Corresp.). ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 21(5), pp. 575-576, 1975. The full citation details ...](Pics/full.jpeg) |
1975 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Jean-Marie Goethals |
Unrestricted codes with the golay parameters are unique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 12(3), pp. 211-224, 1975. The full citation details ...](Pics/full.jpeg) |
1975 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Jean-Marie Goethals |
Alternating Bilinear Forms over GF(q). ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 19(1), pp. 26-50, 1975. The full citation details ...](Pics/full.jpeg) |
1975 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte |
Four Fundamental Parameters of a Code and Their Combinatorial Significance ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Control. ![In: Inf. Control. 23(5), pp. 407-438, December 1973. The full citation details ...](Pics/full.jpeg) |
1973 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Jean-Jacques Quisquater |
Permutation Cascades with Normalized Cells ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Control. ![In: Inf. Control. 23(4), pp. 344-356, November 1973. The full citation details ...](Pics/full.jpeg) |
1973 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte |
Weights of linear codes and strongly regular normed spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 3(1-3), pp. 47-64, 1972. The full citation details ...](Pics/full.jpeg) |
1972 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte |
Majority Logic Decodable Codes Derived from Finite Inversive Planes ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Control. ![In: Inf. Control. 18(4), pp. 319-325, May 1971. The full citation details ...](Pics/full.jpeg) |
1971 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte |
On cyclic codes that are invariant under the general linear group. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 16(6), pp. 760-769, 1970. The full citation details ...](Pics/full.jpeg) |
1970 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Jean-Marie Goethals, F. Jessie MacWilliams |
On Generalized Reed-Muller Codes and Their Relatives ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Control. ![In: Inf. Control. 16(5), pp. 403-442, July 1970. The full citation details ...](Pics/full.jpeg) |
1970 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Delsarte, Jean-Marie Goethals |
Tri-weight Codes and Generalized Hadamard Matrices ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Control. ![In: Inf. Control. 15(2), pp. 196-206, August 1969. The full citation details ...](Pics/full.jpeg) |
1969 |
DBLP DOI BibTeX RDF |
|
33 | Jean-Marie Goethals, Philippe Delsarte |
On a class of majority-logic decodable cyclic codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 14(2), pp. 182-188, 1968. The full citation details ...](Pics/full.jpeg) |
1968 |
DBLP DOI BibTeX RDF |
|
27 | Somantika Datta |
Welch bound equality sets with few distinct inner products from Delsarte-Goethals sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cryptogr. Commun. ![In: Cryptogr. Commun. 15(3), pp. 719-729, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
27 | Rupert Li |
Unique optima of the Delsarte linear program. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 91(6), pp. 2117-2140, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
27 | V Arvind Rameshwar 0001, Navin Kashyap |
A Version of Delsarte's Linear Program for Constrained Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIT ![In: IEEE International Symposium on Information Theory, ISIT 2023, Taipei, Taiwan, June 25-30, 2023, pp. 30-35, 2023, IEEE, 978-1-6654-7554-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
27 | Rupert Li |
Unique Optima of the Delsarte Linear Program. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2204.06090, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
27 | Gary R. W. Greaves, Jack H. Koolen, Jongyook Park |
Augmenting the Delsarte bound: A forbidden interval for the order of maximal cliques in strongly regular graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 97, pp. 103384, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
27 | Mark Magsino, Dustin G. Mixon, Hans Parshall |
A Delsarte-Style Proof of the Bukh-Cox Bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1902.00926, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
27 | Máté Matolcsi, Mihály Weiner |
An Improvement on the Delsarte-Type LP-Bound with Application to MUBs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Open Syst. Inf. Dyn. ![In: Open Syst. Inf. Dyn. 22(1), pp. 1550001:1-1550001:10, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
27 | Javier de la Cruz, Elisa Gorla, Hiram H. Lopez, Alberto Ravagnani |
Rank distribution of Delsarte codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1510.01008, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
27 | László Babai, John Wilmes |
Asymptotic Delsarte cliques in distance-regular graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1503.02746, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
27 | Marco F. Duarte, Sina Jafarpour, A. Robert Calderbank |
Performance of the Delsarte-Goethals Frame on Clustered Sparse Vectors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 61(8), pp. 1998-2008, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
27 | Cristian Arteaga, Isabel Marrero |
Universal approximation by radial basis function networks of Delsarte translates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Networks ![In: Neural Networks 46, pp. 299-305, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
27 | Elodie Leducq |
A new proof of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords of generalized Reed-Muller codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Finite Fields Their Appl. ![In: Finite Fields Their Appl. 18(3), pp. 581-586, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
27 | Daniel J. Katz |
On theorems of Delsarte-McEliece and Chevalley-Warning-Ax-Katz. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 65(3), pp. 291-324, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
27 | Byung Gyun Kang, Hyun Kwang Kim, Phan Thanh Toan |
Delsarte's Linear Programming Bound for Constant-Weight Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 58(9), pp. 5956-5962, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
27 | Tao Feng 0001, Gennian Ge, Sihuang Hu |
Association schemes related to Delsarte-Goethals codes ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1212.0347, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
27 | Bas Heijne |
The maximal rank of elliptic Delsarte surfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. ![In: Math. Comput. 81(278), pp. 1111-1130, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
27 | Kai-Uwe Schmidt |
On the correlation distribution of Delsarte-Goethals sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 59(1-3), pp. 333-347, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
27 | Sejeong Bang, Akira Hiraki, Jack H. Koolen |
Delsarte Set Graphs with Small c2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 26(2), pp. 147-162, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
27 | Elodie Leducq |
A new proof of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords of generalized Reed-Muller code ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1001.2554, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
27 | Michael Nixon, Philippe Pasquier, Magy Seif El-Nasr |
DelsArtMap: Applying Delsarte's Aesthetic System to Virtual Agents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IVA ![In: Intelligent Virtual Agents, 10th International Conference, IVA 2010, Philadelphia, PA, USA, September 20-22, 2010. Proceedings, pp. 139-145, 2010, Springer, 978-3-642-15891-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
27 | Noga Alon, Eyal Lubetzky |
Graph Powers, Delsarte, Hoffman, Ramsey, and Shannon. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 21(2), pp. 329-348, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
27 | Sejeong Bang, Akira Hiraki, Jacobus H. Koolen |
Delsarte clique graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 28(2), pp. 501-516, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
27 | Florian Pfender |
Improved Delsarte bounds for spherical codes in small dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 114(6), pp. 1133-1147, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
27 | Alphonse P. Magnus |
Freud equations for Legendre polynomials on a circular arc and solution of the Grünbaum-Delsarte-Janssen-Vries problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Approx. Theory ![In: J. Approx. Theory 139(1-2), pp. 75-90, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
27 | Tatsuro Ito |
Designs in a coset geometry: Delsarte theory revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 25(2), pp. 229-238, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
27 | Svetla Nikova, Ventzislav Nikov |
Improvement of the Delsarte Bound for t-Designs When It Is Not the Best Bound Possible. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 28(2), pp. 201-222, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
27 | Alex Samorodnitsky |
On the Optimum of Delsarte's Linear Program. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 96(2), pp. 261-287, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
27 | Vladimir I. Levenshtein |
Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 197-198, pp. 515-536, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
27 | William J. Martin |
Design systems: Combinatorial characterizations of Delsarte $\mathcal T$-designs via partially ordered sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Codes and Association Schemes ![In: Codes and Association Schemes, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, November 9-12, 1999, pp. 223-239, 1999, DIMACS/AMS, 978-0-8218-2074-2. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
27 | Yaron Shany, Ilan Reuven, Yair Be'ery |
On the Trellis Representation of the Delsarte-Goethals Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 44(4), pp. 1547-1554, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
27 | Satomi Higashimura |
A Remark on Generalized Fisher Inequalities of Delsarte'st-Designs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 18(5), pp. 557-561, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
27 | Tor Helleseth, P. Vijay Kumar, Abhijit G. Shanbhag |
Codes with the Same Weight Distributions as the Goethals Codes and the Delsarte-Goethals Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 9(3), pp. 257-266, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
27 | Claude Carlet |
The Automorphism Groups of the Delsarte-Goethals Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 3(3), pp. 237-249, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
27 | Juriaan Simonis, Cornelis de Vroedt |
A Simple Proof of the Delsarte Inequalities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 1(1), pp. 77-82, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
27 | Ferdinand Hergert |
On the delsarte-goethals codes and their formal duals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 83(2-3), pp. 249-263, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
27 | Cees Roos, Cornelis de Vroedt |
Upper bounds for A(n, 4) and A(n, 6) derived from Delsarte's linear programming bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 40(2-3), pp. 261-276, 1982. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
|
27 | Alexander Schrijver |
A comparison of the Delsarte and Lovász bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 25(4), pp. 425-429, 1979. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
|
27 | Robert J. McEliece, Eugene R. Rodemich, Howard Rumsey Jr., Lloyd R. Welch |
New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 23(2), pp. 157-166, 1977. The full citation details ...](Pics/full.jpeg) |
1977 |
DBLP DOI BibTeX RDF |
|
19 | Guobiao Weng, Lei Hu |
Some results on skew Hadamard difference sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 50(1), pp. 93-105, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
AMS Classification 05B10 |
19 | Kai-Uwe Schmidt |
Quaternary Constant-Amplitude Codes for Multicode CDMA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 55(4), pp. 1824-1832, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|