scispace - formally typeset
Search or ask a question
Topic

Minimum weight

About: Minimum weight is a research topic. Over the lifetime, 2002 publications have been published within this topic receiving 28244 citations.


Papers
More filters
Posted Content
TL;DR: In this article, a new computer assisted technique for lower bounding the minimum distance of linear codes similar to those used in SHA-1 message expansion was developed. But this technique is not suitable for the case of message expansion codes.
Abstract: We develop a new computer assisted technique for lower bounding the minimum distance of linear codes similar to those used in SHA-1 message expansion. Using this technique, we prove that a modified SHA-1 like code has minimum distance at least 82, and that too in just the last 64 of the 80 expanded words. Further the minimum weight in the last 60 words (last 48 words) is at least 75 (52 respectively). We propose a new compression function which is identical to SHA-1 except for the modified message expansion code. We argue that the high minimum weight of the message expansion code makes the new compression function resistant to recent differential attacks.

17 citations

Journal Article
TL;DR: In this paper, the problem of finding maximum weighted matchings in bipartite graphs with nonnegative integer weights was considered, and an O(Wn ω ) time algorithm was given.
Abstract: In this paper we consider the problem of finding maximum weighted matchings in bipartite graphs with nonnegative integer weights. The presented algorithm for this problem work in 0(Wn ω ) 1 time, where ω is the matrix multiplication exponent, and W is the highest edge weight in the graph. As a consequence of this result we obtain O(Wn ω ) time algorithms for computing: minimum weight bipartite vertex cover, single source shortest paths and minimum weight vertex disjoint s-t paths.

17 citations

Patent
30 Sep 1974
TL;DR: A plurality of parallel constructed members that have means for securing the two parallel members together along an axis parallel to the longitudinal axis of the members to lend structural support relative to each other as mentioned in this paper.
Abstract: A plurality of parallel constructed members that have means for securing the two parallel members together along an axis parallel to the longitudinal axis of the members to lend structural support of the members relative to each other. This allows the structurally secured members to have structures having high strength to weight ratios and requiring minimum volume for the securing structure.

17 citations

Journal ArticleDOI
TL;DR: In this paper, a problem formulation and a solution methodology for minimum weight design of laminated non-prismatic thin-walled composite spatial members of generic section is presented.

16 citations

Journal ArticleDOI
TL;DR: In this paper, a computer program determination of barreling effect on strength of ring and stringer stiffened shells designed to support axial compression loads is presented, based on a simulation.
Abstract: Computer program determination of barreling effect on strength of ring and stringer stiffened shells designed to support axial compression loads

16 citations


Network Information
Related Topics (5)
Upper and lower bounds
56.9K papers, 1.1M citations
76% related
Time complexity
36K papers, 879.5K citations
73% related
Numerical analysis
52.2K papers, 1.2M citations
73% related
Optimization problem
96.4K papers, 2.1M citations
73% related
Polynomial
52.6K papers, 853.1K citations
72% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202321
202239
202153
202051
201966
201858