On the public citation graph
Designs as maximum codes in polynomial metric spaces
0 signed · 161 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00181327openalex-snapshot
On 4-gonal configurations with parameters r=q 2+1 and k=q+1
inferredcites →https://doi.org/10.1007/bf01788103openalex-snapshot
t-designs in classical association schemes
inferredcites →https://doi.org/10.1007/bf01788661openalex-snapshot
Tight 4 and 5-designs in projective spaces
inferredcites →https://doi.org/10.1016/0021-8693(78)90220-xopenalex-snapshot
Strongly regular graphs having strongly regular subconstituents
inferredcites →https://doi.org/10.1016/0097-3165(75)90090-4openalex-snapshot
Alternating bilinear forms over GF(q)
inferredcites →https://doi.org/10.1016/0097-3165(76)90017-0openalex-snapshot
Association schemes and t-designs in regular semilattices
inferredcites →https://doi.org/10.1016/0097-3165(78)90015-8openalex-snapshot
Bilinear forms over a finite field, with applications to coding theory
inferredcites →https://doi.org/10.1016/0097-3165(79)90074-8openalex-snapshot
New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
inferredcites →https://doi.org/10.1016/0097-3165(81)90023-6openalex-snapshot
A partially ordered set and q-Krawtchouk polynomials
inferredcites →https://doi.org/10.1016/0097-3165(85)90016-0openalex-snapshot
Association schemes of quadratic forms
inferredcites →https://doi.org/10.1016/0097-3165(87)90042-2openalex-snapshot
A characterization of P- and Q-polynomial association schemes
inferredcites →https://doi.org/10.1016/b978-0-12-189420-7.50020-7openalex-snapshot
BOUNDS FOR SYSTEMS OF LINES, AND JACOBI POLYNOMIALS
inferredcites →https://doi.org/10.1016/s0021-9800(69)80095-5openalex-snapshot
Some maximal arcs in finite projective planes
inferredcites →https://doi.org/10.1016/s0195-6698(82)80035-8openalex-snapshot
t-Designs in Projective Spaces
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1017/cbo9780511987045.023openalex-snapshot
Strongly regular graphs and partial geometries
inferredcites →https://doi.org/10.1090/conm/009/655979openalex-snapshot
Recent bounds for codes, sphere packings and related problems obtained by linear programming and other methods
inferredcites →https://doi.org/10.1090/gsm/034openalex-snapshot
Differential Geometry, Lie Groups, and Symmetric Spaces
inferredcites →https://doi.org/10.1090/mmono/022openalex-snapshot
Special Functions and the Theory of Group Representations
inferredcites →https://doi.org/10.1090/trans2/037/04openalex-snapshot
Spherical functions on symmetric Riemannian spaces
inferredcites →https://doi.org/10.1109/tit.1977.1055688openalex-snapshot
New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
inferredcites →https://doi.org/10.1112/blms/18.2.97openalex-snapshot
The Geometry of Two-Weight Codes
inferredcites →https://doi.org/10.1112/jlms/s2-26.2.365openalex-snapshot
On Uniformly Packed [n , n -k , 4] Codes over GF(q ) and a Class of Caps in PG(k -1, q )
inferredcites →https://doi.org/10.1134/11122.1608-3253openalex-snapshot
Problems of Information Transmission
inferredcites →https://doi.org/10.1137/0125027openalex-snapshot
The Addition Formula for Jacobi Polynomials and Spherical Harmonics
inferredcites →https://doi.org/10.1137/0134012openalex-snapshot
Hahn Polynomials, Discrete Harmonics, and t -Designs
inferredcites →https://doi.org/10.1137/0513044openalex-snapshot
Orthogonal Polynomials, Duality and Association Schemes
inferredcites →https://doi.org/10.1215/s0012-7094-42-00908-6openalex-snapshot
Positive definite functions on spheres
inferredcites →https://doi.org/10.1307/mmj/1029002165openalex-snapshot
Discrete quadrature and bounds on $t$-designs.
inferredcites →https://doi.org/10.2140/pjm.1963.13.389openalex-snapshot
Strongly regular graphs, partial geometries and partially balanced designs
inferredcites →https://doi.org/10.2307/2374091openalex-snapshot
Some q-Krawtchouk Polynomials on Chevalley Groups
inferredcites →https://doi.org/10.4153/cjm-1970-020-2openalex-snapshot
Linearization of the Product of Jacobi Polynomials. I
inferredcites →https://doi.org/10.7146/math.scand.a-11778openalex-snapshot
Bounds for quaternionic line systems and reflection groups.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1520-6610(1999)7:5<316::aid-jcd2>3.0.co;2-zopenalex-snapshot
On maximal Spherical codes II
inferred← citeshttps://doi.org/10.1006/eujc.1993.1049openalex-snapshot
Packing and Decomposition Problems for Polynomial Association Schemes
inferred← citeshttps://doi.org/10.1006/eujc.1998.0278openalex-snapshot
Necessary Conditions for Existence of Some Designs in Polynomial Metric Spaces
inferred← citeshttps://doi.org/10.1007/3-540-45325-3_18openalex-snapshot
Improvement of the Delsarte Bound for τ-Designs in Finite Polynomial Metric Spaces
inferred← citeshttps://doi.org/10.1007/3-540-56686-4_31openalex-snapshot
Bounds for codes as solutions of extremum problems for systems of orthogonal polynomials
inferred← citeshttps://doi.org/10.1007/3-540-57843-9_27openalex-snapshot
On Plotkin-Elias type bounds for binary arithmetic codes
inferred← citeshttps://doi.org/10.1007/3-540-60114-7_12openalex-snapshot
On maximal spherical codes I
inferred← citeshttps://doi.org/10.1007/3-540-63163-1_3openalex-snapshot
On maximal codes in polynomial metric spaces
inferred← citeshttps://doi.org/10.1007/978-3-030-72284-5_13openalex-snapshot
The Mathematical Aspects of Some Problems from Coding Theory
inferred← citeshttps://doi.org/10.1007/978-3-031-95551-8_5openalex-snapshot
Absolute Minima of Potentials of a Certain Class of Spherical Designs
inferred← citeshttps://doi.org/10.1007/978-3-319-53139-7_5openalex-snapshot
Packing: Combinatorial Models for Various Types of Errors
inferred← citeshttps://doi.org/10.1007/978-3-7091-2786-5_14openalex-snapshot
Bounds for Self-Complementary Codes and Their Applications
inferred← citeshttps://doi.org/10.1007/bf01225671openalex-snapshot
Linear programming bounds for codes in infinite projective spaces
inferred← citeshttps://doi.org/10.1007/bf02570701openalex-snapshot
Extremal polynomials for obtaining bounds for spherical codes and designs
inferred← citeshttps://doi.org/10.1007/jhep12(2020)066openalex-snapshot
High-dimensional sphere packing and the modular bootstrap
inferred← citeshttps://doi.org/10.1007/pl00000504openalex-snapshot
Uniqueness of the 120-point spherical 11-design in four dimensions
inferred← citeshttps://doi.org/10.1007/s00010-024-01036-6openalex-snapshot
Odd strength spherical designs attaining the Fazekas–Levenshtein bound for covering and universal minima of potentials
inferred← citeshttps://doi.org/10.1007/s000130050035openalex-snapshot
On lower bounds on the size of designs in compact symmetric spaces of rank 1
inferred← citeshttps://doi.org/10.1007/s00041-020-09790-2openalex-snapshot
On the Search for Tight Frames of Low Coherence
inferred← citeshttps://doi.org/10.1007/s00208-023-02738-zopenalex-snapshot
New upper bounds for spherical codes and packings
inferred← citeshttps://doi.org/10.1007/s00365-016-9327-5openalex-snapshot
Universal Lower Bounds for Potential Energy of Spherical Codes
inferred← citeshttps://doi.org/10.1007/s00373-015-1613-7openalex-snapshot
Linear Programming Bounds for Regular Graphs
inferred← citeshttps://doi.org/10.1007/s00373-017-1784-5openalex-snapshot
Harmonic Index Designs in Binary Hamming Schemes
inferred← citeshttps://doi.org/10.1007/s00454-019-00123-9openalex-snapshot
Upper Energy Bounds for Spherical Designs of Relatively Small Cardinalities
inferred← citeshttps://doi.org/10.1007/s00454-025-00805-7openalex-snapshot
Designs Related Through Projective and Hopf Maps
inferred← citeshttps://doi.org/10.1007/s00498-020-00263-xopenalex-snapshot
Continuous dependence of linear differential systems on polynomial modules
inferred← citeshttps://doi.org/10.1007/s00605-024-02021-6openalex-snapshot
Stability of optimal spherical codes
inferred← citeshttps://doi.org/10.1007/s10474-018-0828-5openalex-snapshot
Towards a proof of the 24-cell conjecture
inferred← citeshttps://doi.org/10.1007/s10623-016-0286-4openalex-snapshot
Energy bounds for codes and designs in Hamming spaces
inferred← citeshttps://doi.org/10.1007/s10623-018-0524-zopenalex-snapshot
On spherical codes with inner products in a prescribed interval
inferred← citeshttps://doi.org/10.1007/s10623-020-00733-yopenalex-snapshot
Upper bounds for energies of spherical codes of given cardinality and separation
inferred← citeshttps://doi.org/10.1007/s10623-023-01191-yopenalex-snapshot
Unique optima of the Delsarte linear program
inferred← citeshttps://doi.org/10.1007/s10623-025-01659-zopenalex-snapshot
Bounds on discrete potentials of spherical (k, k)-designs
inferred← citeshttps://doi.org/10.1007/s10801-026-01578-9openalex-snapshot
New bounds on the covering radius of orthogonal arrays of even strength
inferred← citeshttps://doi.org/10.1007/s13324-019-00313-xopenalex-snapshot
Energy bounds for codes in polynomial metric spaces
inferred← citeshttps://doi.org/10.1007/s13324-024-01009-7openalex-snapshot
Energy bounds for weighted spherical codes and designs via linear programming
inferred← citeshttps://doi.org/10.1016/0024-3795(95)00153-iopenalex-snapshot
Computing distance distributions of spherical designs
inferred← citeshttps://doi.org/10.1016/0097-3165(95)90093-4openalex-snapshot
On upper bounds for code distance and covering radius of designs in polynomial metric spaces
inferred← citeshttps://doi.org/10.1016/j.automatica.2012.02.016openalex-snapshot
Axiomatic characterization of linear differential systems (and operators)
inferred← citeshttps://doi.org/10.1016/j.automatica.2013.06.010openalex-snapshot
The PBH test for multidimensional LTID systems
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113346openalex-snapshot
Bounds for the sum of distances of spherical sets of small size
inferred← citeshttps://doi.org/10.1016/j.ejc.2008.08.001openalex-snapshot
Lower bounds for projective designs, cubature formulas and related isometric embeddings
inferred← citeshttps://doi.org/10.1016/j.ejc.2008.11.007openalex-snapshot
A survey on spherical designs and algebraic combinatorics on spheres
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.03.003openalex-snapshot
Bounds on three- and higher-distance sets
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2020.05.004openalex-snapshot
Great antipodal sets on complex Grassmannian manifolds as designs with the smallest cardinalities
inferred← citeshttps://doi.org/10.1016/j.jat.2023.105930openalex-snapshot
Absolute minima of potentials of certain regular spherical configurations
inferred← citeshttps://doi.org/10.1016/j.jcta.2008.05.001openalex-snapshot
Optimality and uniqueness of the (4,10,1/6) spherical code
inferred← citeshttps://doi.org/10.1016/j.jmaa.2023.127065openalex-snapshot
On polarization of spherical codes and designs
inferred← citeshttps://doi.org/10.1016/j.laa.2009.07.012openalex-snapshot
How to define the dual of a higher-dimensional linear system
inferred← citeshttps://doi.org/10.1016/j.laa.2010.10.017openalex-snapshot
First order representations of Fliess models
inferred← citeshttps://doi.org/10.1016/j.laa.2012.09.034openalex-snapshot
A note on Ehrenpreis’ fundamental principle
inferred← citeshttps://doi.org/10.1016/j.laa.2022.03.028openalex-snapshot
Rationality of the inner products of spherical s-distance t-designs for t ≥ 2s − 2, s ≥ 3
inferred← citeshttps://doi.org/10.1016/j.sysconle.2014.02.011openalex-snapshot
Characterization of linear differential systems (in several variables)
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00074-0openalex-snapshot
On designs in compact metric spaces and a universal bound on their size
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00259-3openalex-snapshot
Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00438-9openalex-snapshot
Some constructions of superimposed codes in Euclidean spaces
inferred← citeshttps://doi.org/10.1016/s0895-7177(03)90063-xopenalex-snapshot
An extremum problem for polynomials and bounds for codes with given distance and diameter
inferred← citeshttps://doi.org/10.1016/s0924-6509(01)80047-7openalex-snapshot
The linear programming bound
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00160-xopenalex-snapshot
Superimposed Codes in n Obtained from Spherical Codes
inferred← citeshttps://doi.org/10.1023/a:1008207230165openalex-snapshot
Split Orthogonal Arrays and Maximum Independent Resilient Systems of Functions
inferred← citeshttps://doi.org/10.1023/a:1022544725332openalex-snapshot
Improvement of the Delsarte bound for t-designs when it is not the best bound possible
inferred← citeshttps://doi.org/10.1063/1.2748617openalex-snapshot
Weighted complex projective 2-designs from bases: Optimal state determination by orthogonal measurements
inferred← citeshttps://doi.org/10.1080/10630732.2017.1335153openalex-snapshot
Making Big Data Small: Strategies to Expand Urban and Geographical Research Using Social Media
inferred← citeshttps://doi.org/10.1088/0305-4470/39/43/009openalex-snapshot
Tight informationally complete quantum measurements
inferred← citeshttps://doi.org/10.1090/conm/747/15047openalex-snapshot
A short history of frames and quantum designs
inferred← citeshttps://doi.org/10.1090/mcom/3621openalex-snapshot
Bounds for spherical codes: The Levenshtein framework lifted
inferred← citeshttps://doi.org/10.1090/proc/13956openalex-snapshot
Maximal orthoplectic fusion frames from mutually unbiased bases and block designs
inferred← citeshttps://doi.org/10.1090/s0894-0347-06-00546-7openalex-snapshot
Universally optimal distribution of points on spheres
inferred← citeshttps://doi.org/10.1090/s0894-0347-2012-00737-1openalex-snapshot
Three-point bounds for energy minimization
inferred← citeshttps://doi.org/10.1090/tran/7976openalex-snapshot
Moment methods in energy minimization: New bounds for Riesz minimal energy problems
inferred← citeshttps://doi.org/10.1103/physreva.111.032433openalex-snapshot
Quantum pushforward designs
inferred← citeshttps://doi.org/10.1109/18.312154openalex-snapshot
The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
inferred← citeshttps://doi.org/10.1109/18.370102openalex-snapshot
Packing radius, covering radius, and dual distance
inferred← citeshttps://doi.org/10.1109/18.370114openalex-snapshot
Spherical codes generated by binary partitions of symmetric pointsets
inferred← citeshttps://doi.org/10.1109/18.412678openalex-snapshot
Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
inferred← citeshttps://doi.org/10.1109/18.532903openalex-snapshot
Upper bounds on the minimum distance of spherical codes
inferred← citeshttps://doi.org/10.1109/18.720545openalex-snapshot
Association schemes and coding theory
inferred← citeshttps://doi.org/10.1109/18.720549openalex-snapshot
The art of signaling: fifty years of coding theory
inferred← citeshttps://doi.org/10.1109/ciss.2008.4558616openalex-snapshot
Frames for linear reconstruction without phase
inferred← citeshttps://doi.org/10.1109/ieeeconf59524.2023.10476892openalex-snapshot
Experimental Survey of Discrete Minimizers of the $p-\text{frame}$ Energy
inferred← citeshttps://doi.org/10.1109/isit.1997.612996openalex-snapshot
Linear programming bounds for codes in infinite projective spaces
inferred← citeshttps://doi.org/10.1109/isit.2019.8849388openalex-snapshot
Linear Programming Bounds for Cardinality and Energy of Codes of Given Min and Max Distances
inferred← citeshttps://doi.org/10.1109/isssta.1996.563207openalex-snapshot
Lower bounds on cross-correlation of codes
inferred← citeshttps://doi.org/10.1109/red.2016.7779322openalex-snapshot
Lower energy bounds for antipodal spherical codes and for codes in infinite projective spaces
inferred← citeshttps://doi.org/10.1109/redundancy48165.2019.9003329openalex-snapshot
On Two Problems Concerning Universal Bounds for Codes
inferred← citeshttps://doi.org/10.1109/redundancy52534.2021.9606455openalex-snapshot
On spherical 4-distance 7-designs
inferred← citeshttps://doi.org/10.1109/tit.2021.3056319openalex-snapshot
Universal Bounds for Size and Energy of Codes of Given Minimum and Maximum Distances
inferred← citeshttps://doi.org/10.1109/tit.2021.3072555openalex-snapshot
Guest Editorial Special Issue: “From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein”
inferred← citeshttps://doi.org/10.1112/jlms.12276openalex-snapshot
Optimal arrangements of classical and quantum states with limited purity
inferred← citeshttps://doi.org/10.1112/s0025579318000360openalex-snapshot
ASYMPTOTIC LINEAR PROGRAMMING LOWER BOUNDS FOR THE ENERGY OF MINIMIZING RIESZ AND GAUSS CONFIGURATIONS
inferred← citeshttps://doi.org/10.1134/s0032946018040026openalex-snapshot
Refinements of Levenshtein Bounds in q-ary Hamming Spaces
inferred← citeshttps://doi.org/10.1134/s0081543815010149openalex-snapshot
A survey on tight Euclidean t-designs and tight relative t-designs in certain association schemes
inferred← citeshttps://doi.org/10.1137/100807053openalex-snapshot
Bounds on s -Distance Sets with Strength t
inferred← citeshttps://doi.org/10.1137/17m1137528openalex-snapshot
Packings in Real Projective Spaces
inferred← citeshttps://doi.org/10.1142/9789812832245_0002openalex-snapshot
A Functional View of Upper Bounds on Codes
inferred← citeshttps://doi.org/10.1561/0100000125openalex-snapshot
Asymptotic Frame Theory for Analog Coding
inferred← citeshttps://doi.org/10.2140/gt.2016.20.1289openalex-snapshot
Optimal simplices and codes in projective spaces
inferred← citeshttps://doi.org/10.22331/q-2020-09-30-338openalex-snapshot
Morphophoric POVMs, generalised qplexes, and 2-designs
inferred← citeshttps://doi.org/10.37236/9891openalex-snapshot
Bounds on Antipodal Spherical Designs with Few Angles
inferred← citeshttps://doi.org/10.3934/amc.2013.7.279openalex-snapshot
New nonexistence results for spherical designs
inferred← citeshttps://doi.org/10.4171/rmi/1329openalex-snapshot
Optimal measures for $p$-frame energies on spheres
inferred← citeshttps://doi.org/10.48550/arxiv.0809.0091openalex-snapshot
A functional view of upper bounds on codes
inferred← citeshttps://doi.org/10.48550/arxiv.1008.5383openalex-snapshot
Bounds on $s$-distance sets with strength $t$
inferred← citeshttps://doi.org/10.48550/arxiv.1509.07837openalex-snapshot
Universal upper and lower bounds on energy of spherical designs
inferred← citeshttps://doi.org/10.48550/arxiv.1510.03406openalex-snapshot
Energy bounds for codes and designs in Hamming spaces
inferred← citeshttps://doi.org/10.48550/arxiv.1806.03549openalex-snapshot
Constructions and properties of optimally spread subspace packings via symmetric and affine block designs and mutually unbiased bases
inferred← citeshttps://doi.org/10.48550/arxiv.1904.11159openalex-snapshot
Moments of isotropic measures and optimal projective codes
inferred← citeshttps://doi.org/10.48550/arxiv.2005.01324openalex-snapshot
Semidefinite Programming Bounds For Spherical Three-distance Sets
inferred← citeshttps://doi.org/10.48550/arxiv.2007.01895openalex-snapshot
On 3-distance spherical 5-designs
inferred← citeshttps://doi.org/10.48550/arxiv.2007.13999openalex-snapshot
Bounds on antipodal spherical designs with few angles
inferred← citeshttps://doi.org/10.48550/arxiv.math/0207208openalex-snapshot
The Z_4-Linearity of Kerdock, Preparata, Goethals and Related Codes
inferred← citeshttps://doi.org/10.48550/arxiv.math/0306405openalex-snapshot
The Delsarte Method in the Problem of the Antipodal Contact Numbers of Euclidean Spaces of High Dimensions
inferred← citeshttps://doi.org/10.48550/arxiv.math/0607448openalex-snapshot
Uniqueness of the (22,891,1/4) spherical code
inferred← citeshttps://doi.org/10.5802/alco.272openalex-snapshot
Bounds for sets with few distances distinct modulo a prime ideal
inferred← citeshttps://doi.org/10.6100/ir552987openalex-snapshot
Applications of polynomials to spherical codes and designs
inferred← citeshttps://doi.org/10.7546/crabs.2020.08.02openalex-snapshot
Linear Programming Bounds for Spherical (k,k)-Designs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.