Searching for "Hardness of approximating the minimum distance of a linear code." – sorted by Relevance.
6 documents found, showing 1 through 6.
-
Hardness of approximating the minimum distance of a linear code
- … time [24]. DUMER et al.: HARDNESS OF APPROXIMATING THE MINIMUM DISTANCE OF A LINEAR CODE 23…
- Cited by 35 (6 self) – Add To MetaCart
-
Hardness of Approximating the Minimum Distance of a Linear Code
- …Hardness of Approximating the Minimum Distance of a Linear Code Ilya Dumer Daniele Micciancio y…
- Add To MetaCart
-
Hardness of Approximating the Minimum Distance of a Linear Code*
- … Hardness of Approximating the Minimum Distance of a Linear Code* Ilya Dumer# Daniele Micciancio…
- Add To MetaCart
-
Awards
- …, “Hardness of approximating the minimum distance of a linear code,” IEEE Transactions on Information Theory…
- Add To MetaCart
-
Subspace polynomials and list decoding of Reed-Solomon codes
- … of approximating the minimum distance of a linear code [DMS99] and constructing error-correcting codes…
- Cited by 2 (0 self) – Add To MetaCart
-
Tensor-based hardness of the shortest vector problem to within almost polynomial factors
- … to amplify the NP-hardness of approximating the minimum distance in a linear code of block length n…
- Cited by 5 (2 self) – Add To MetaCart
Showing 1 through 6.
