Pith. sign in

REVIEW 1 cited by

Applications of semidefinite programming to coding theory

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1009.1512 v1 pith:3RJS72NA submitted 2010-09-08 cs.IT math.IT

Christine Bachoc (IMB) This is my paper · ORCID
classification cs.ITmath.IT
keywords programmingsemidefinitetheoryapplicationscodingframeworkgeneralgeneralizations
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We survey recent generalizations and improvements of the linear programming method that involve semidefinite programming. A general framework using group representations and tools from graph theory is provided.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Schrijver Number Quasi-Tensorization and Multicolor Ramsey Bounds via Robust OR Polynomials

    math.CO 2026-07 accept novelty 7.0 of 10

    A robust OR polynomial yields Schrijver quasi-tensorization ϑ'(⊠Gi)≤∏ϑ'(Gi)^{C log r log ϑ'(Gi)} and improves Rr(k) to exp(−Ω(k/(r^9(log r)^6))) r^{rk}.

Pith tools