On Covering Problems of Codes

descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 1997Publisher:Springer Science and Business Media LLCJournal:Theory of Computing Systems, volume 30, pages 113-119 (issn: 1432-4350, eissn: 1433-0490,

Copyright policy )

Authors: Moti Frances; Ami Litman;

doi: 10.1007/s002240000044 , 10.1007/bf02679443

On Covering Problems of Codes

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

Technion – Israel Institute of Technology
Israel

Keywords

covering radius, 3SAT problem, Analysis of algorithms and problem complexity, radius decision problem, Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	138
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average