Linear Programming Bounds for Codes via a Covering Argument

Discrete and Computational Geometry - United States
doi 10.1007/s00454-008-9128-0
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

On the Covering Radius Problem for Codes I. Bounds on Normalized Covering Radius

SIAM Journal on Algebraic Discrete Methods
1987English

Using Linear Programming to Decode Binary Linear Codes

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
2005English

Attainable Bounds for Generalized Moments via Mathematical Programming

English

Generalized Chebyshev Bounds via Semidefinite Programming

SIAM Review
Computational MathematicsApplied MathematicsTheoretical Computer Science
2007English

Bounds on the Covering Radius of Some Classes of Codes Over R

Open Journal of Discrete Applied Mathematics
2019English

Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2006English

Computational Bounds for Elevator Control Policies by Large Scale Linear Programming

Mathematical Methods of Operations Research
Management ScienceSoftwareOperations ResearchMathematics
2013English

New Upper Bounds for Nonbinary Codes Based on the Terwilliger Algebra and Semidefinite Programming

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2006English

Linear Index Coding via Semidefinite Programming

2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy