Linear programming bounds for unitary codes

DOI10.3934/AMC.2010.4.323zbMATH Open1213.94200OpenAlexW1968351048MaRDI QIDQ540378FDOQ540378

Authors: Jean Creignou, Hervé Diet 

Publication date: 3 June 2011

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2010.4.323

Recommendations

• Linear programming bounds
• scientific article; zbMATH DE number 3543912
• Spectral approach to linear programming bounds on codes
• Linear programming bounds for codes of small size
• Linear programming bounds for codes in grassmannian spaces

zbMATH Keywords

linear programmingboundsunitary matricesspace time codesunitary codes

Mathematics Subject Classification ID

Algebraic combinatorics (05E99) Optimality conditions for problems involving relations other than differential equations (49K21) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Bounds on codes (94B65) Communication, information (94A99) Variational principles of physics (49S99) Variational methods for eigenvalues of operators (49R99)

Cited In (9)

• Spectral approach to linear programming bounds on codes
• Title not available (Why is that?)
• Linear codes on unitary space
• Monotonicity of the quantum linear programming bound
• A Survey of Algebraic Unitary Codes
• Linear programming bounds
• Linear programming bounds for distributed storage codes
• Invariant Semidefinite Programs
• Title not available (Why is that?)

This page was built for publication: Linear programming bounds for unitary codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540378)