✦ LIBER ✦

A vector-space packing problem

✍ Scribed by Carl Maneri; Robert Silverman

Publisher: Elsevier Science
Year: 1966
Tongue: English
Weight: 491 KB
Volume: 4
Category: Article
ISSN: 0021-8693
DOI: 10.1016/0021-8693(66)90024-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vector packing in finite dimensional vec

Vector packing in finite dimensional vector spaces

✍ Michael H. Moore 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 463 KB

Approximation schemes for ordered vector

Approximation schemes for ordered vector packing problems

✍ Alberto Caprara; Hans Kellerer; Ulrich Pferschy 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

A branch-and-bound algorithm for the two

A branch-and-bound algorithm for the two-dimensional vector packing problem

✍ Frits C.R. Spieksma 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 661 KB

A combinatorial problem for vector space

A combinatorial problem for vector spaces over finite fields

✍ Harald Niederreiter 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 767 KB

We study a combinatorial problem for vector spaces over finite fields which generalizes the following classical problem in algebraic coding theory: given a finite field Fq and integers n > k 2 1, find the largest minimum distance that can be achieved by a linear code over Fq with fixed length n and

Vector spaces and the four-color problem

✍ Leonard S. Bobrow 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 296 KB

The Hahn-Banach Problem in Convergence V

The Hahn-Banach Problem in Convergence Vector Spaces

✍ Ronald Beattie 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 803 KB