Linear programming bounds for unitary codes

DOI10.3934/AMC.2010.4.323MaRDI QIDQ540378zbMATHOpenAlexFDO

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

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)

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

Cited in

(9)

• A Survey of Algebraic Unitary Codes
• Invariant Semidefinite Programs
• scientific article; zbMATH DE number 1123782 (Why is no real title available?)
• scientific article; zbMATH DE number 3543912 (Why is no real title available?)
• Spectral approach to linear programming bounds on codes
• Linear programming bounds for distributed storage codes
• Linear codes on unitary space
• Linear programming bounds
• Monotonicity of the quantum linear programming bound

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)