Amanote Research

Amanote Research

    RegisterSign In

Improved Lower Bounds for Multicovering Codes

IEEE Transactions on Information Theory - United States
doi 10.1109/18.796398
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
Date

January 1, 1999

Authors
A. Klapper
Publisher

Institute of Electrical and Electronics Engineers (IEEE)


Related search

Improved Techniques for Lower Bounds for Odd Perfect Numbers

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1991English

Optimal Lower Bounds for Quantum Automata and Random Access Codes

English

Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2006English

Improved Bounds for the Rate Loss of Multi-Resolution Source Codes

English

Improved Lower Bounds for Ginzburg–Landau Energies via Mass Displacement

Analysis and PDE
Applied MathematicsNumerical AnalysisAnalysis
2011English

Improved Lower Bounds for Tree-Like Resolution Over Linear Inequalities

English

Informational Divergence Bounds for Authentication Codes

English

Lower Bounds

2016English

Lower Bounds for Subgraph Isomorphism

2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy