Minimum weight

Known as: Minimum Hamming weight 
In error-correcting coding, the minimum Hamming weight, commonly referred to as the minimum weight wmin of a code is the weight of the lowest-weight… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1976-2018
012319762018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In optimum designing of wireless power transfer (WPT) coils, maximum efficiency and maximum power transfer capability of coils… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • table I
Is this relevant?
2015
2015
Consider a 2-D square array of qubits of extent L × L. We provide a proof that the minimum weight perfect matching problem… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2013
2013
Minimum weight dominating set (MWDS) finds many uses in solving problems as varied as clustering in wireless networks, multi… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2010
2010
The paper analyzes the existing Linux virtual server (LVS) cluster load balancing algorithm and its inadequacies that not real… (More)
  • figure 4
Is this relevant?
2008
2008
We describe a polynomial time algorithm to find a minimum weight feedback vertex set, or equivalently, a maximum weight induced… (More)
  • figure 1
Is this relevant?
2008
2008
The geometric codes are the orthogonals of the codes defined by the designs associated with finite geometries. The latter are… (More)
Is this relevant?
2007
2007
Cognitive wireless ad hoc is highly focused as a promising future wireless technology. However, cognitive wireless ad hoc… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2004
2004
We consider the problem of computing a minimum weight pseudo-triangulation of a set S of n points in the plane. We first present… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1992
1992
Let G be a simple graph with non-negative edge weights. Determining a minimum weight spanning tree is a fundamental problem that… (More)
  • figure 2.2
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We investigate the minimum weight path problem in networks whose link weights and link delays are both functions of time. We… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?