Hardness of Approximating the Minimum Distance of a Linear Code

IEEE Transactions on Information Theory - United States
doi 10.1109/tit.2002.806118
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related search

On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
2001English

Approximating the Distance to Monotonicity of Boolean Functions

2020English

The Minimum Monopoly Distance Energy of a Graph

International Journal of Computer Applications
2015English

On the Hardness of Approximating Shortest Integer Relations Among Rational Numbers

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1998English

The Minimum Size of a Linear Set

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

Approximating the Minimum Spanning Tree Weight in Sublinear Time

SIAM Journal on Computing
MathematicsComputer Science
2005English

On the Minimum Distance of Cyclic Codes

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

Minimum Distance Estimation of the Binormal ROC Curve

Statistical Papers
UncertaintyStatisticsProbability
2017English

A General Approach to the Optimality of Minimum Distance Estimators

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1984English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy