Bounds for projective codes from semidefinite programming-Reference-Cited by-同舟云学术

Bounds for projective codes from semidefinite programming

Published:2013 Issue:2 Volume:7 Page:127-145
ISSN:1930-5338
Container-title:Advances in Mathematics of Communications
language:en
Short-container-title:

Author:

Bachoc Christine, ,Passuello Alberto,Vallentin Frank,

Publisher

American Institute of Mathematical Sciences (AIMS)

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics,Computer Networks and Communications,Algebra and Number Theory,Applied Mathematics,Discrete Mathematics and Combinatorics,Computer Networks and Communications,Algebra and Number Theory

Reference28 articles.

1. Network information flow,;R. Ahlswede;IEEE Trans. Inform. Theory,2000

2. Applications of semidefinite programming to coding theory,;C. Bachoc;in,2010

3. Invariant semidefinite programs,;C. Bachoc;in,2012

4. More semidefinite programming bounds (extended abstract),;C. Bachoc;in,2007

5. New upper bounds for kissing numbers from semidefinite programming,;C. Bachoc;J. Amer. Math. Soc.,2008

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. New constructions of Sidon spaces;Journal of Algebraic Combinatorics;2021-09-24

2. On the Lengths of Divisible Codes;IEEE Transactions on Information Theory;2020-07

3. Subspace Codes Based on Partial Injective Maps of Vector Spaces Over Finite Fields;IEEE Access;2020

4. New and updated semidefinite programming bounds for subspace codes;Advances in Mathematics of Communications;2020

5. New lower bounds for partial k‐parallelisms;Journal of Combinatorial Designs;2019-10-31